java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:36:23,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:36:23,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:36:23,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:36:23,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:36:23,506 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:36:23,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:36:23,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:36:23,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:36:23,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:36:23,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:36:23,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:36:23,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:36:23,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:36:23,539 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:36:23,540 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:36:23,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:36:23,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:36:23,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:36:23,553 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:36:23,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:36:23,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:36:23,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:36:23,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:36:23,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:36:23,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:36:23,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:36:23,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:36:23,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:36:23,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:36:23,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:36:23,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:36:23,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:36:23,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:36:23,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:36:23,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:36:23,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:36:23,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:36:23,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:36:23,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:36:23,602 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:36:23,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:36:23,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:36:23,603 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:36:23,603 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:36:23,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:36:23,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:36:23,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:36:23,674 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:36:23,675 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:36:23,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-07-25 08:36:23,676 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-07-25 08:36:23,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:36:23,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:36:23,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:23,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:36:23,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:36:23,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,796 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:36:23,797 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:36:23,797 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:36:23,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:36:23,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:36:23,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:36:23,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:36:23,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:36:23,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:36:23,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:36:23,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:36:23,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/1) ... [2018-07-25 08:36:23,919 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 08:36:23,920 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 08:36:23,920 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 08:36:24,123 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:36:24,124 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:24 BoogieIcfgContainer [2018-07-25 08:36:24,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:36:24,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:36:24,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:36:24,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:36:24,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:36:23" (1/2) ... [2018-07-25 08:36:24,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aca3c0 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:36:24, skipping insertion in model container [2018-07-25 08:36:24,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:36:24" (2/2) ... [2018-07-25 08:36:24,134 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-07-25 08:36:24,145 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:36:24,153 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-07-25 08:36:24,197 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:36:24,198 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:36:24,198 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:36:24,198 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:36:24,199 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:36:24,199 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:36:24,199 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:36:24,199 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:36:24,199 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:36:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-07-25 08:36:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:36:24,223 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:24,224 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 08:36:24,226 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:24,232 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-07-25 08:36:24,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:24,352 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:24,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:24,357 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:24,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:24,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:24,377 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-07-25 08:36:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:24,615 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-07-25 08:36:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:36:24,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:36:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:24,633 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:36:24,634 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:36:24,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:36:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-07-25 08:36:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:36:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-07-25 08:36:24,698 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-07-25 08:36:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:24,699 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-07-25 08:36:24,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-07-25 08:36:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:36:24,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:24,700 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 08:36:24,700 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:24,701 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-07-25 08:36:24,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:24,724 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:24,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:24,726 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:36:24,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:36:24,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:24,727 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-07-25 08:36:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:24,888 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-07-25 08:36:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:36:24,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:36:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:24,890 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:36:24,890 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:36:24,892 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:36:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:36:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-07-25 08:36:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:36:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-07-25 08:36:24,905 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-07-25 08:36:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:24,905 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-07-25 08:36:24,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:36:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-07-25 08:36:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:36:24,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:24,907 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:24,907 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-07-25 08:36:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:24,970 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:24,970 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 08:36:24,970 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:24,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:24,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:24,971 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-07-25 08:36:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:25,317 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-07-25 08:36:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:25,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:36:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:25,320 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:36:25,320 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:36:25,323 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:36:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-07-25 08:36:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:36:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-07-25 08:36:25,368 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-07-25 08:36:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:25,368 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-07-25 08:36:25,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-07-25 08:36:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:36:25,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:25,373 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-25 08:36:25,373 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-07-25 08:36:25,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:25,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:25,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:36:25,435 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:25,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:25,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:25,437 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2018-07-25 08:36:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:25,608 INFO L93 Difference]: Finished difference Result 102 states and 180 transitions. [2018-07-25 08:36:25,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:25,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:36:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:25,610 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:36:25,610 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:36:25,611 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:36:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2018-07-25 08:36:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:36:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 111 transitions. [2018-07-25 08:36:25,645 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 111 transitions. Word has length 7 [2018-07-25 08:36:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:25,646 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 111 transitions. [2018-07-25 08:36:25,646 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 111 transitions. [2018-07-25 08:36:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:25,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:25,648 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:25,649 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-07-25 08:36:25,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:25,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:25,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:25,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:25,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:25,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:25,702 INFO L87 Difference]: Start difference. First operand 65 states and 111 transitions. Second operand 9 states. [2018-07-25 08:36:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:25,933 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2018-07-25 08:36:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:25,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:36:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:25,943 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:36:25,943 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:36:25,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:36:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-07-25 08:36:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:36:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2018-07-25 08:36:25,979 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 9 [2018-07-25 08:36:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:25,980 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2018-07-25 08:36:25,980 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-07-25 08:36:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:25,982 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:25,982 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:25,983 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1999237099, now seen corresponding path program 1 times [2018-07-25 08:36:25,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:26,038 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:26,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:26,039 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:26,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:26,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:26,040 INFO L87 Difference]: Start difference. First operand 74 states and 128 transitions. Second operand 9 states. [2018-07-25 08:36:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:26,427 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2018-07-25 08:36:26,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:26,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:36:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:26,429 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:36:26,430 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:36:26,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:36:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-07-25 08:36:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:36:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 145 transitions. [2018-07-25 08:36:26,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 145 transitions. Word has length 9 [2018-07-25 08:36:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:26,468 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 145 transitions. [2018-07-25 08:36:26,468 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 145 transitions. [2018-07-25 08:36:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:26,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:26,475 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-07-25 08:36:26,475 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313901, now seen corresponding path program 2 times [2018-07-25 08:36:26,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 08:36:26,490 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:26,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:26,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:36:26,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:36:26,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:36:26,494 INFO L87 Difference]: Start difference. First operand 83 states and 145 transitions. Second operand 4 states. [2018-07-25 08:36:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:26,530 INFO L93 Difference]: Finished difference Result 119 states and 205 transitions. [2018-07-25 08:36:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:36:26,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-25 08:36:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:26,531 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:36:26,531 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:36:26,532 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:36:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:36:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:36:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2018-07-25 08:36:26,556 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 9 [2018-07-25 08:36:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:26,557 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2018-07-25 08:36:26,557 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:36:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2018-07-25 08:36:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:36:26,558 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:26,558 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:36:26,559 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -855455763, now seen corresponding path program 1 times [2018-07-25 08:36:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:36:26,577 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:26,577 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:36:26,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:36:26,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:36:26,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:36:26,580 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand 4 states. [2018-07-25 08:36:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:26,615 INFO L93 Difference]: Finished difference Result 111 states and 178 transitions. [2018-07-25 08:36:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:36:26,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-07-25 08:36:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:26,617 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:36:26,617 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:36:26,618 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:36:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:36:26,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:36:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:36:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2018-07-25 08:36:26,641 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 9 [2018-07-25 08:36:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:26,641 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2018-07-25 08:36:26,641 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:36:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2018-07-25 08:36:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:26,645 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:26,646 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:26,646 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-07-25 08:36:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:26,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:26,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:26,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:26,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:26,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:26,714 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 8 states. [2018-07-25 08:36:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:26,871 INFO L93 Difference]: Finished difference Result 97 states and 143 transitions. [2018-07-25 08:36:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:26,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:26,872 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:36:26,873 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:36:26,874 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:36:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2018-07-25 08:36:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:36:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2018-07-25 08:36:26,907 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 10 [2018-07-25 08:36:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:26,907 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2018-07-25 08:36:26,908 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2018-07-25 08:36:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:26,909 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:26,909 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:26,910 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-07-25 08:36:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:26,953 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:26,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:26,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:26,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:26,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:26,955 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand 8 states. [2018-07-25 08:36:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,100 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2018-07-25 08:36:27,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:36:27,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:27,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,101 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:36:27,102 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:36:27,103 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:36:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:36:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2018-07-25 08:36:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:36:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2018-07-25 08:36:27,132 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 10 [2018-07-25 08:36:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,133 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2018-07-25 08:36:27,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2018-07-25 08:36:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:27,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,135 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,136 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-07-25 08:36:27,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:27,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:27,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:27,172 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:27,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:27,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:27,173 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand 8 states. [2018-07-25 08:36:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,252 INFO L93 Difference]: Finished difference Result 91 states and 143 transitions. [2018-07-25 08:36:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:27,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,253 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:36:27,254 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:36:27,255 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:36:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-07-25 08:36:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:36:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2018-07-25 08:36:27,281 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 10 [2018-07-25 08:36:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,281 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2018-07-25 08:36:27,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2018-07-25 08:36:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:27,282 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,283 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,283 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-07-25 08:36:27,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:27,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:27,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:27,304 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:27,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:27,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:27,305 INFO L87 Difference]: Start difference. First operand 84 states and 132 transitions. Second operand 7 states. [2018-07-25 08:36:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,446 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2018-07-25 08:36:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:27,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-25 08:36:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,448 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:36:27,448 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:36:27,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:36:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-07-25 08:36:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:36:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2018-07-25 08:36:27,476 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 10 [2018-07-25 08:36:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,477 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2018-07-25 08:36:27,477 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2018-07-25 08:36:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:27,478 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,478 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,478 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-07-25 08:36:27,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:27,511 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:27,511 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:27,512 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:27,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:27,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:27,513 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand 8 states. [2018-07-25 08:36:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,659 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-25 08:36:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:27,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,660 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:36:27,660 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:36:27,661 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:36:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 100. [2018-07-25 08:36:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:36:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-25 08:36:27,690 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-25 08:36:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,690 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-25 08:36:27,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-25 08:36:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:27,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,692 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,692 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-07-25 08:36:27,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:27,719 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:27,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:27,720 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:27,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:27,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:27,721 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-25 08:36:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:27,877 INFO L93 Difference]: Finished difference Result 116 states and 171 transitions. [2018-07-25 08:36:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:27,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:27,878 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:36:27,878 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:36:27,879 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:36:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2018-07-25 08:36:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:36:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2018-07-25 08:36:27,913 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 10 [2018-07-25 08:36:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:27,913 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2018-07-25 08:36:27,913 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2018-07-25 08:36:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:27,914 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:27,915 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:27,915 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-07-25 08:36:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:27,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:27,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:27,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:27,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:27,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:27,955 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 8 states. [2018-07-25 08:36:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,099 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-25 08:36:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:28,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,101 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:36:28,101 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:36:28,102 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:36:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2018-07-25 08:36:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:36:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 167 transitions. [2018-07-25 08:36:28,137 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 167 transitions. Word has length 10 [2018-07-25 08:36:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:28,138 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 167 transitions. [2018-07-25 08:36:28,138 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 167 transitions. [2018-07-25 08:36:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:28,139 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:28,139 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:28,140 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-07-25 08:36:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:28,164 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:28,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:28,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:28,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:28,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:28,169 INFO L87 Difference]: Start difference. First operand 105 states and 167 transitions. Second operand 8 states. [2018-07-25 08:36:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,311 INFO L93 Difference]: Finished difference Result 124 states and 186 transitions. [2018-07-25 08:36:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:28,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,312 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:36:28,312 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:36:28,313 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:36:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-07-25 08:36:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:36:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2018-07-25 08:36:28,348 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 10 [2018-07-25 08:36:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:28,348 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2018-07-25 08:36:28,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2018-07-25 08:36:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:28,349 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:28,349 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:28,350 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-07-25 08:36:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:28,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:28,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:28,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:28,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:28,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:28,365 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand 7 states. [2018-07-25 08:36:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,492 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2018-07-25 08:36:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:28,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-25 08:36:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,494 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:36:28,494 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:36:28,495 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:36:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-07-25 08:36:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:36:28,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2018-07-25 08:36:28,533 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 10 [2018-07-25 08:36:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:28,534 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2018-07-25 08:36:28,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2018-07-25 08:36:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:28,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:28,535 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:28,535 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-07-25 08:36:28,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:28,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:28,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:28,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:28,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:28,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:28,556 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand 8 states. [2018-07-25 08:36:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,651 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2018-07-25 08:36:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:36:28,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,653 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:36:28,653 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:36:28,654 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:36:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2018-07-25 08:36:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:36:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 193 transitions. [2018-07-25 08:36:28,736 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 193 transitions. Word has length 10 [2018-07-25 08:36:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:28,737 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 193 transitions. [2018-07-25 08:36:28,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 193 transitions. [2018-07-25 08:36:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:28,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:28,738 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:28,738 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:28,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-07-25 08:36:28,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:28,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:28,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:28,766 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:28,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:28,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:28,767 INFO L87 Difference]: Start difference. First operand 121 states and 193 transitions. Second operand 8 states. [2018-07-25 08:36:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:28,906 INFO L93 Difference]: Finished difference Result 137 states and 209 transitions. [2018-07-25 08:36:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:28,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:28,907 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:36:28,907 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:36:28,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:36:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2018-07-25 08:36:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:36:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-25 08:36:28,947 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-25 08:36:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:28,947 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-25 08:36:28,947 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-25 08:36:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:36:28,948 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:28,948 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:28,949 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-07-25 08:36:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:28,967 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:28,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 08:36:28,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:28,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:28,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:28,969 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 8 states. [2018-07-25 08:36:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:29,091 INFO L93 Difference]: Finished difference Result 147 states and 223 transitions. [2018-07-25 08:36:29,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:36:29,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-07-25 08:36:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:29,092 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:36:29,093 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:36:29,093 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:36:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:36:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 129. [2018-07-25 08:36:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:36:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2018-07-25 08:36:29,130 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 10 [2018-07-25 08:36:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:29,130 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2018-07-25 08:36:29,130 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2018-07-25 08:36:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:29,131 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:29,131 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:29,131 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-07-25 08:36:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:29,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:29,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:29,168 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:29,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:29,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:29,168 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand 10 states. [2018-07-25 08:36:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:29,399 INFO L93 Difference]: Finished difference Result 151 states and 226 transitions. [2018-07-25 08:36:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:29,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 08:36:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:29,401 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:36:29,401 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:36:29,402 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:36:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:36:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-07-25 08:36:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:36:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 192 transitions. [2018-07-25 08:36:29,445 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 192 transitions. Word has length 12 [2018-07-25 08:36:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:29,445 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 192 transitions. [2018-07-25 08:36:29,445 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 192 transitions. [2018-07-25 08:36:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:29,446 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:29,446 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:29,447 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 447688542, now seen corresponding path program 1 times [2018-07-25 08:36:29,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:29,477 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:36:29,477 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-07-25 08:36:29,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:29,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:29,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:29,479 INFO L87 Difference]: Start difference. First operand 121 states and 192 transitions. Second operand 10 states. [2018-07-25 08:36:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:29,645 INFO L93 Difference]: Finished difference Result 149 states and 233 transitions. [2018-07-25 08:36:29,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:29,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 08:36:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:29,649 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:36:29,650 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:36:29,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:36:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:36:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-07-25 08:36:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:36:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 216 transitions. [2018-07-25 08:36:29,700 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 216 transitions. Word has length 12 [2018-07-25 08:36:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:29,700 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 216 transitions. [2018-07-25 08:36:29,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 216 transitions. [2018-07-25 08:36:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:29,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:29,703 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:29,703 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1316178012, now seen corresponding path program 1 times [2018-07-25 08:36:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:29,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:29,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:29,734 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:29,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:29,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:29,735 INFO L87 Difference]: Start difference. First operand 136 states and 216 transitions. Second operand 9 states. [2018-07-25 08:36:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:29,858 INFO L93 Difference]: Finished difference Result 145 states and 230 transitions. [2018-07-25 08:36:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:29,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-07-25 08:36:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:29,859 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:36:29,859 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:36:29,860 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:36:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:36:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:36:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 229 transitions. [2018-07-25 08:36:29,912 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 229 transitions. Word has length 12 [2018-07-25 08:36:29,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:29,912 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 229 transitions. [2018-07-25 08:36:29,912 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 229 transitions. [2018-07-25 08:36:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:36:29,913 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:29,913 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:29,914 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-07-25 08:36:29,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:29,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:29,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:29,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:29,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:29,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:29,943 INFO L87 Difference]: Start difference. First operand 144 states and 229 transitions. Second operand 10 states. [2018-07-25 08:36:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:30,163 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2018-07-25 08:36:30,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:30,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-07-25 08:36:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:30,165 INFO L225 Difference]: With dead ends: 168 [2018-07-25 08:36:30,165 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:36:30,166 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:36:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:36:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-07-25 08:36:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:36:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 217 transitions. [2018-07-25 08:36:30,223 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 217 transitions. Word has length 12 [2018-07-25 08:36:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:30,224 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 217 transitions. [2018-07-25 08:36:30,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 217 transitions. [2018-07-25 08:36:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:30,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:30,225 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:30,225 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1139034733, now seen corresponding path program 1 times [2018-07-25 08:36:30,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:30,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:30,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:30,251 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:30,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:30,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:30,252 INFO L87 Difference]: Start difference. First operand 137 states and 217 transitions. Second operand 9 states. [2018-07-25 08:36:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:30,390 INFO L93 Difference]: Finished difference Result 164 states and 254 transitions. [2018-07-25 08:36:30,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:30,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:30,392 INFO L225 Difference]: With dead ends: 164 [2018-07-25 08:36:30,392 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:36:30,393 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:36:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-07-25 08:36:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:36:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 241 transitions. [2018-07-25 08:36:30,457 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 241 transitions. Word has length 13 [2018-07-25 08:36:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:30,457 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 241 transitions. [2018-07-25 08:36:30,457 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 241 transitions. [2018-07-25 08:36:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:30,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:30,458 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:30,458 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-07-25 08:36:30,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:30,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:30,479 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:30,479 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:30,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:30,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:30,480 INFO L87 Difference]: Start difference. First operand 151 states and 241 transitions. Second operand 9 states. [2018-07-25 08:36:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:30,719 INFO L93 Difference]: Finished difference Result 217 states and 338 transitions. [2018-07-25 08:36:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:30,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:30,724 INFO L225 Difference]: With dead ends: 217 [2018-07-25 08:36:30,724 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 08:36:30,725 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 08:36:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 163. [2018-07-25 08:36:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:36:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 260 transitions. [2018-07-25 08:36:30,795 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 260 transitions. Word has length 13 [2018-07-25 08:36:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:30,796 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 260 transitions. [2018-07-25 08:36:30,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2018-07-25 08:36:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:30,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:30,797 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:30,797 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash -86604803, now seen corresponding path program 1 times [2018-07-25 08:36:30,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:30,821 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:30,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:30,822 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:30,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:30,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:30,822 INFO L87 Difference]: Start difference. First operand 163 states and 260 transitions. Second operand 9 states. [2018-07-25 08:36:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:31,034 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2018-07-25 08:36:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:31,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:31,036 INFO L225 Difference]: With dead ends: 208 [2018-07-25 08:36:31,036 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 08:36:31,037 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 08:36:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-07-25 08:36:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:36:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 277 transitions. [2018-07-25 08:36:31,119 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 277 transitions. Word has length 13 [2018-07-25 08:36:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:31,119 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 277 transitions. [2018-07-25 08:36:31,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 277 transitions. [2018-07-25 08:36:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:31,121 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:31,121 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:31,121 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash -86605091, now seen corresponding path program 1 times [2018-07-25 08:36:31,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:31,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:31,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:31,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:31,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:31,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:31,137 INFO L87 Difference]: Start difference. First operand 173 states and 277 transitions. Second operand 7 states. [2018-07-25 08:36:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:31,319 INFO L93 Difference]: Finished difference Result 229 states and 357 transitions. [2018-07-25 08:36:31,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:31,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 08:36:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:31,321 INFO L225 Difference]: With dead ends: 229 [2018-07-25 08:36:31,321 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 08:36:31,322 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 08:36:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 203. [2018-07-25 08:36:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:36:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 329 transitions. [2018-07-25 08:36:31,420 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 329 transitions. Word has length 13 [2018-07-25 08:36:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:31,421 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 329 transitions. [2018-07-25 08:36:31,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 329 transitions. [2018-07-25 08:36:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:31,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:31,423 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:31,424 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-07-25 08:36:31,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:31,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:31,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:31,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:31,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:31,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:31,447 INFO L87 Difference]: Start difference. First operand 203 states and 329 transitions. Second operand 8 states. [2018-07-25 08:36:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:31,718 INFO L93 Difference]: Finished difference Result 254 states and 401 transitions. [2018-07-25 08:36:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:31,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-25 08:36:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:31,720 INFO L225 Difference]: With dead ends: 254 [2018-07-25 08:36:31,721 INFO L226 Difference]: Without dead ends: 252 [2018-07-25 08:36:31,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-07-25 08:36:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 206. [2018-07-25 08:36:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 08:36:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 334 transitions. [2018-07-25 08:36:31,814 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 334 transitions. Word has length 13 [2018-07-25 08:36:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:31,814 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 334 transitions. [2018-07-25 08:36:31,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 334 transitions. [2018-07-25 08:36:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:31,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:31,816 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:31,816 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298927, now seen corresponding path program 2 times [2018-07-25 08:36:31,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:31,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:31,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:31,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:31,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:31,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:31,838 INFO L87 Difference]: Start difference. First operand 206 states and 334 transitions. Second operand 9 states. [2018-07-25 08:36:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:32,044 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2018-07-25 08:36:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:32,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:32,046 INFO L225 Difference]: With dead ends: 220 [2018-07-25 08:36:32,047 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 08:36:32,047 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 08:36:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2018-07-25 08:36:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:36:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 328 transitions. [2018-07-25 08:36:32,127 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 328 transitions. Word has length 13 [2018-07-25 08:36:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:32,128 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 328 transitions. [2018-07-25 08:36:32,128 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 328 transitions. [2018-07-25 08:36:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:32,129 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:32,129 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:32,129 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 2 times [2018-07-25 08:36:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:32,150 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:32,150 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:32,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:32,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:32,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:32,151 INFO L87 Difference]: Start difference. First operand 203 states and 328 transitions. Second operand 7 states. [2018-07-25 08:36:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:32,321 INFO L93 Difference]: Finished difference Result 227 states and 353 transitions. [2018-07-25 08:36:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:32,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 08:36:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:32,323 INFO L225 Difference]: With dead ends: 227 [2018-07-25 08:36:32,323 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 08:36:32,323 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 08:36:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-07-25 08:36:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 08:36:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 323 transitions. [2018-07-25 08:36:32,407 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 323 transitions. Word has length 13 [2018-07-25 08:36:32,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:32,407 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 323 transitions. [2018-07-25 08:36:32,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 323 transitions. [2018-07-25 08:36:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:32,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:32,408 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:32,408 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-07-25 08:36:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:32,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:32,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:32,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:32,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:32,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:32,430 INFO L87 Difference]: Start difference. First operand 201 states and 323 transitions. Second operand 9 states. [2018-07-25 08:36:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:32,672 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2018-07-25 08:36:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:32,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:32,674 INFO L225 Difference]: With dead ends: 244 [2018-07-25 08:36:32,674 INFO L226 Difference]: Without dead ends: 242 [2018-07-25 08:36:32,675 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:36:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-25 08:36:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 198. [2018-07-25 08:36:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 08:36:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 318 transitions. [2018-07-25 08:36:32,753 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 318 transitions. Word has length 13 [2018-07-25 08:36:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:32,754 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 318 transitions. [2018-07-25 08:36:32,754 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 318 transitions. [2018-07-25 08:36:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:32,755 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:32,755 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:32,755 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-07-25 08:36:32,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:32,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:32,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:32,771 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:32,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:32,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:32,772 INFO L87 Difference]: Start difference. First operand 198 states and 318 transitions. Second operand 7 states. [2018-07-25 08:36:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:32,949 INFO L93 Difference]: Finished difference Result 222 states and 342 transitions. [2018-07-25 08:36:32,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:32,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 08:36:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:32,951 INFO L225 Difference]: With dead ends: 222 [2018-07-25 08:36:32,951 INFO L226 Difference]: Without dead ends: 220 [2018-07-25 08:36:32,952 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-25 08:36:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2018-07-25 08:36:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 08:36:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 311 transitions. [2018-07-25 08:36:33,033 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 311 transitions. Word has length 13 [2018-07-25 08:36:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:33,033 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 311 transitions. [2018-07-25 08:36:33,034 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 311 transitions. [2018-07-25 08:36:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:33,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:33,036 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:33,036 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 267373789, now seen corresponding path program 1 times [2018-07-25 08:36:33,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:33,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:33,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:33,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:33,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:33,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:33,061 INFO L87 Difference]: Start difference. First operand 194 states and 311 transitions. Second operand 9 states. [2018-07-25 08:36:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:33,215 INFO L93 Difference]: Finished difference Result 219 states and 343 transitions. [2018-07-25 08:36:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:33,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:33,217 INFO L225 Difference]: With dead ends: 219 [2018-07-25 08:36:33,218 INFO L226 Difference]: Without dead ends: 218 [2018-07-25 08:36:33,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-25 08:36:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 200. [2018-07-25 08:36:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 08:36:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 322 transitions. [2018-07-25 08:36:33,298 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 322 transitions. Word has length 13 [2018-07-25 08:36:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:33,298 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 322 transitions. [2018-07-25 08:36:33,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 322 transitions. [2018-07-25 08:36:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:33,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:33,299 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:33,300 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-07-25 08:36:33,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:33,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:33,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:33,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:33,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:33,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:33,325 INFO L87 Difference]: Start difference. First operand 200 states and 322 transitions. Second operand 9 states. [2018-07-25 08:36:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:33,560 INFO L93 Difference]: Finished difference Result 251 states and 394 transitions. [2018-07-25 08:36:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:33,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:33,562 INFO L225 Difference]: With dead ends: 251 [2018-07-25 08:36:33,562 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 08:36:33,563 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:36:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 08:36:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2018-07-25 08:36:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-25 08:36:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 345 transitions. [2018-07-25 08:36:33,650 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 345 transitions. Word has length 13 [2018-07-25 08:36:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:33,651 INFO L472 AbstractCegarLoop]: Abstraction has 214 states and 345 transitions. [2018-07-25 08:36:33,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 345 transitions. [2018-07-25 08:36:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:33,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:33,652 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:33,652 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277807, now seen corresponding path program 2 times [2018-07-25 08:36:33,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:33,668 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:33,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:36:33,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:36:33,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:36:33,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:36:33,669 INFO L87 Difference]: Start difference. First operand 214 states and 345 transitions. Second operand 7 states. [2018-07-25 08:36:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:33,835 INFO L93 Difference]: Finished difference Result 258 states and 407 transitions. [2018-07-25 08:36:33,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:36:33,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-25 08:36:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:33,837 INFO L225 Difference]: With dead ends: 258 [2018-07-25 08:36:33,837 INFO L226 Difference]: Without dead ends: 256 [2018-07-25 08:36:33,838 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-07-25 08:36:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2018-07-25 08:36:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 08:36:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 382 transitions. [2018-07-25 08:36:33,938 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 382 transitions. Word has length 13 [2018-07-25 08:36:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:33,939 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 382 transitions. [2018-07-25 08:36:33,939 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:36:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 382 transitions. [2018-07-25 08:36:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:33,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:33,940 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:33,940 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:33,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2115277519, now seen corresponding path program 2 times [2018-07-25 08:36:33,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:33,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:33,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:33,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:33,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:33,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:33,964 INFO L87 Difference]: Start difference. First operand 236 states and 382 transitions. Second operand 9 states. [2018-07-25 08:36:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:34,212 INFO L93 Difference]: Finished difference Result 270 states and 424 transitions. [2018-07-25 08:36:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:34,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:34,214 INFO L225 Difference]: With dead ends: 270 [2018-07-25 08:36:34,215 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 08:36:34,215 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 08:36:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 241. [2018-07-25 08:36:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 08:36:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 391 transitions. [2018-07-25 08:36:34,326 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 391 transitions. Word has length 13 [2018-07-25 08:36:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:34,327 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 391 transitions. [2018-07-25 08:36:34,327 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 391 transitions. [2018-07-25 08:36:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:34,328 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:34,328 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:34,328 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-07-25 08:36:34,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:34,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:34,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:34,343 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:34,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:34,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:34,344 INFO L87 Difference]: Start difference. First operand 241 states and 391 transitions. Second operand 8 states. [2018-07-25 08:36:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:34,604 INFO L93 Difference]: Finished difference Result 296 states and 468 transitions. [2018-07-25 08:36:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:34,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-07-25 08:36:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:34,607 INFO L225 Difference]: With dead ends: 296 [2018-07-25 08:36:34,607 INFO L226 Difference]: Without dead ends: 294 [2018-07-25 08:36:34,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-25 08:36:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 245. [2018-07-25 08:36:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 08:36:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 397 transitions. [2018-07-25 08:36:34,741 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 397 transitions. Word has length 13 [2018-07-25 08:36:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:34,741 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 397 transitions. [2018-07-25 08:36:34,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 397 transitions. [2018-07-25 08:36:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:34,742 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:34,742 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:34,743 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash -238445237, now seen corresponding path program 1 times [2018-07-25 08:36:34,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:34,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:34,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:34,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:34,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:34,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:34,762 INFO L87 Difference]: Start difference. First operand 245 states and 397 transitions. Second operand 9 states. [2018-07-25 08:36:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:34,969 INFO L93 Difference]: Finished difference Result 270 states and 431 transitions. [2018-07-25 08:36:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:34,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:34,972 INFO L225 Difference]: With dead ends: 270 [2018-07-25 08:36:34,972 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 08:36:34,972 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 08:36:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 260. [2018-07-25 08:36:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-07-25 08:36:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2018-07-25 08:36:35,110 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 13 [2018-07-25 08:36:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:35,110 INFO L472 AbstractCegarLoop]: Abstraction has 260 states and 423 transitions. [2018-07-25 08:36:35,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 423 transitions. [2018-07-25 08:36:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:35,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:35,112 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:35,112 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-07-25 08:36:35,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:35,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:35,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:35,133 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:35,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:35,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:35,134 INFO L87 Difference]: Start difference. First operand 260 states and 423 transitions. Second operand 9 states. [2018-07-25 08:36:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:35,431 INFO L93 Difference]: Finished difference Result 317 states and 507 transitions. [2018-07-25 08:36:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:35,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:35,434 INFO L225 Difference]: With dead ends: 317 [2018-07-25 08:36:35,434 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 08:36:35,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 08:36:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 252. [2018-07-25 08:36:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-07-25 08:36:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 411 transitions. [2018-07-25 08:36:35,541 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 411 transitions. Word has length 13 [2018-07-25 08:36:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:35,541 INFO L472 AbstractCegarLoop]: Abstraction has 252 states and 411 transitions. [2018-07-25 08:36:35,541 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 411 transitions. [2018-07-25 08:36:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:36:35,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:35,542 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:36:35,542 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -24071906, now seen corresponding path program 1 times [2018-07-25 08:36:35,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:35,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:35,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:35,562 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:35,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:35,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:35,562 INFO L87 Difference]: Start difference. First operand 252 states and 411 transitions. Second operand 9 states. [2018-07-25 08:36:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:35,804 INFO L93 Difference]: Finished difference Result 317 states and 513 transitions. [2018-07-25 08:36:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:36:35,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-07-25 08:36:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:35,806 INFO L225 Difference]: With dead ends: 317 [2018-07-25 08:36:35,806 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 08:36:35,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:36:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 08:36:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2018-07-25 08:36:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-07-25 08:36:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 423 transitions. [2018-07-25 08:36:35,922 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 423 transitions. Word has length 13 [2018-07-25 08:36:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:35,922 INFO L472 AbstractCegarLoop]: Abstraction has 258 states and 423 transitions. [2018-07-25 08:36:35,922 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 423 transitions. [2018-07-25 08:36:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:35,923 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:35,924 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:35,924 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash -603538094, now seen corresponding path program 1 times [2018-07-25 08:36:35,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:35,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:35,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:35,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:35,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:35,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:35,955 INFO L87 Difference]: Start difference. First operand 258 states and 423 transitions. Second operand 11 states. [2018-07-25 08:36:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:36,188 INFO L93 Difference]: Finished difference Result 273 states and 437 transitions. [2018-07-25 08:36:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:36,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:36,190 INFO L225 Difference]: With dead ends: 273 [2018-07-25 08:36:36,191 INFO L226 Difference]: Without dead ends: 272 [2018-07-25 08:36:36,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-25 08:36:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 249. [2018-07-25 08:36:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 08:36:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 408 transitions. [2018-07-25 08:36:36,307 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 408 transitions. Word has length 15 [2018-07-25 08:36:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:36,308 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 408 transitions. [2018-07-25 08:36:36,308 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 408 transitions. [2018-07-25 08:36:36,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:36,309 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:36,309 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:36,309 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2021827592, now seen corresponding path program 1 times [2018-07-25 08:36:36,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:36,329 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:36,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:36,329 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:36,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:36,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:36,330 INFO L87 Difference]: Start difference. First operand 249 states and 408 transitions. Second operand 11 states. [2018-07-25 08:36:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:36,543 INFO L93 Difference]: Finished difference Result 279 states and 448 transitions. [2018-07-25 08:36:36,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:36,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:36,545 INFO L225 Difference]: With dead ends: 279 [2018-07-25 08:36:36,545 INFO L226 Difference]: Without dead ends: 278 [2018-07-25 08:36:36,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-25 08:36:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 255. [2018-07-25 08:36:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 08:36:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 418 transitions. [2018-07-25 08:36:36,663 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 418 transitions. Word has length 15 [2018-07-25 08:36:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:36,663 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 418 transitions. [2018-07-25 08:36:36,664 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 418 transitions. [2018-07-25 08:36:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:36,665 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:36,665 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:36,665 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2013238847, now seen corresponding path program 1 times [2018-07-25 08:36:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:36,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:36,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:36,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:36,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:36,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:36,683 INFO L87 Difference]: Start difference. First operand 255 states and 418 transitions. Second operand 9 states. [2018-07-25 08:36:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:36,911 INFO L93 Difference]: Finished difference Result 296 states and 483 transitions. [2018-07-25 08:36:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:36:36,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-25 08:36:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:36,913 INFO L225 Difference]: With dead ends: 296 [2018-07-25 08:36:36,914 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 08:36:36,914 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:36:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 08:36:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 246. [2018-07-25 08:36:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-25 08:36:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 403 transitions. [2018-07-25 08:36:37,035 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 403 transitions. Word has length 15 [2018-07-25 08:36:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:37,035 INFO L472 AbstractCegarLoop]: Abstraction has 246 states and 403 transitions. [2018-07-25 08:36:37,035 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 403 transitions. [2018-07-25 08:36:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:37,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:37,036 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:37,037 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1215990847, now seen corresponding path program 1 times [2018-07-25 08:36:37,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:37,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:37,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:37,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:37,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:37,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:37,061 INFO L87 Difference]: Start difference. First operand 246 states and 403 transitions. Second operand 11 states. [2018-07-25 08:36:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:37,281 INFO L93 Difference]: Finished difference Result 274 states and 449 transitions. [2018-07-25 08:36:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:37,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:37,283 INFO L225 Difference]: With dead ends: 274 [2018-07-25 08:36:37,283 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 08:36:37,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 08:36:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-07-25 08:36:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 08:36:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 438 transitions. [2018-07-25 08:36:37,415 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 438 transitions. Word has length 15 [2018-07-25 08:36:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:37,415 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 438 transitions. [2018-07-25 08:36:37,415 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 438 transitions. [2018-07-25 08:36:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:37,416 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:37,416 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:37,416 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash -994782852, now seen corresponding path program 1 times [2018-07-25 08:36:37,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:37,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:37,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:37,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:37,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:37,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:37,448 INFO L87 Difference]: Start difference. First operand 267 states and 438 transitions. Second operand 11 states. [2018-07-25 08:36:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:37,738 INFO L93 Difference]: Finished difference Result 311 states and 496 transitions. [2018-07-25 08:36:37,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:36:37,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:37,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:37,741 INFO L225 Difference]: With dead ends: 311 [2018-07-25 08:36:37,741 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 08:36:37,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:36:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 08:36:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 279. [2018-07-25 08:36:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 08:36:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 457 transitions. [2018-07-25 08:36:37,882 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 457 transitions. Word has length 15 [2018-07-25 08:36:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:37,883 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 457 transitions. [2018-07-25 08:36:37,883 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 457 transitions. [2018-07-25 08:36:37,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:37,884 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:37,884 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:37,884 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:37,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1087577094, now seen corresponding path program 2 times [2018-07-25 08:36:37,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:37,906 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:37,906 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:37,906 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:37,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:37,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:37,907 INFO L87 Difference]: Start difference. First operand 279 states and 457 transitions. Second operand 12 states. [2018-07-25 08:36:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:38,261 INFO L93 Difference]: Finished difference Result 313 states and 495 transitions. [2018-07-25 08:36:38,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:36:38,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-25 08:36:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:38,263 INFO L225 Difference]: With dead ends: 313 [2018-07-25 08:36:38,263 INFO L226 Difference]: Without dead ends: 312 [2018-07-25 08:36:38,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:36:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-07-25 08:36:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 284. [2018-07-25 08:36:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-07-25 08:36:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 466 transitions. [2018-07-25 08:36:38,447 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 466 transitions. Word has length 15 [2018-07-25 08:36:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:38,447 INFO L472 AbstractCegarLoop]: Abstraction has 284 states and 466 transitions. [2018-07-25 08:36:38,448 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 466 transitions. [2018-07-25 08:36:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:38,449 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:38,449 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:38,449 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1086284228, now seen corresponding path program 1 times [2018-07-25 08:36:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:38,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:38,474 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:38,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:38,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:38,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:38,475 INFO L87 Difference]: Start difference. First operand 284 states and 466 transitions. Second operand 11 states. [2018-07-25 08:36:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:38,928 INFO L93 Difference]: Finished difference Result 354 states and 563 transitions. [2018-07-25 08:36:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:36:38,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:38,930 INFO L225 Difference]: With dead ends: 354 [2018-07-25 08:36:38,931 INFO L226 Difference]: Without dead ends: 352 [2018-07-25 08:36:38,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:36:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-07-25 08:36:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 296. [2018-07-25 08:36:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-25 08:36:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 486 transitions. [2018-07-25 08:36:39,076 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 486 transitions. Word has length 15 [2018-07-25 08:36:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:39,076 INFO L472 AbstractCegarLoop]: Abstraction has 296 states and 486 transitions. [2018-07-25 08:36:39,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:39,077 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 486 transitions. [2018-07-25 08:36:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:39,077 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:39,078 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:39,078 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577631, now seen corresponding path program 1 times [2018-07-25 08:36:39,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:39,094 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:39,094 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:39,095 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:39,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:39,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:39,095 INFO L87 Difference]: Start difference. First operand 296 states and 486 transitions. Second operand 11 states. [2018-07-25 08:36:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:39,328 INFO L93 Difference]: Finished difference Result 332 states and 544 transitions. [2018-07-25 08:36:39,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:39,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:39,330 INFO L225 Difference]: With dead ends: 332 [2018-07-25 08:36:39,330 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 08:36:39,331 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:39,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 08:36:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 318. [2018-07-25 08:36:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-07-25 08:36:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 523 transitions. [2018-07-25 08:36:39,505 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 523 transitions. Word has length 15 [2018-07-25 08:36:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:39,505 INFO L472 AbstractCegarLoop]: Abstraction has 318 states and 523 transitions. [2018-07-25 08:36:39,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 523 transitions. [2018-07-25 08:36:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:39,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:39,506 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:39,507 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1365577919, now seen corresponding path program 1 times [2018-07-25 08:36:39,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:39,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:39,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:39,522 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:39,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:39,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:39,523 INFO L87 Difference]: Start difference. First operand 318 states and 523 transitions. Second operand 10 states. [2018-07-25 08:36:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:40,028 INFO L93 Difference]: Finished difference Result 503 states and 808 transitions. [2018-07-25 08:36:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:36:40,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:40,031 INFO L225 Difference]: With dead ends: 503 [2018-07-25 08:36:40,031 INFO L226 Difference]: Without dead ends: 501 [2018-07-25 08:36:40,032 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:36:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-25 08:36:40,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 396. [2018-07-25 08:36:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-25 08:36:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 658 transitions. [2018-07-25 08:36:40,237 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 658 transitions. Word has length 15 [2018-07-25 08:36:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:40,238 INFO L472 AbstractCegarLoop]: Abstraction has 396 states and 658 transitions. [2018-07-25 08:36:40,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 658 transitions. [2018-07-25 08:36:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:40,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:40,239 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:40,239 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:40,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1374166088, now seen corresponding path program 1 times [2018-07-25 08:36:40,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:40,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:40,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:40,259 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:40,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:40,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:40,260 INFO L87 Difference]: Start difference. First operand 396 states and 658 transitions. Second operand 12 states. [2018-07-25 08:36:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:40,664 INFO L93 Difference]: Finished difference Result 489 states and 800 transitions. [2018-07-25 08:36:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:40,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-07-25 08:36:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:40,667 INFO L225 Difference]: With dead ends: 489 [2018-07-25 08:36:40,667 INFO L226 Difference]: Without dead ends: 488 [2018-07-25 08:36:40,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:36:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-07-25 08:36:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 429. [2018-07-25 08:36:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-07-25 08:36:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 718 transitions. [2018-07-25 08:36:40,901 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 718 transitions. Word has length 15 [2018-07-25 08:36:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:40,901 INFO L472 AbstractCegarLoop]: Abstraction has 429 states and 718 transitions. [2018-07-25 08:36:40,901 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 718 transitions. [2018-07-25 08:36:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:40,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:40,903 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:40,903 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-07-25 08:36:40,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:40,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:40,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:40,925 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:40,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:40,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:40,926 INFO L87 Difference]: Start difference. First operand 429 states and 718 transitions. Second operand 11 states. [2018-07-25 08:36:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:41,302 INFO L93 Difference]: Finished difference Result 484 states and 793 transitions. [2018-07-25 08:36:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:41,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:41,305 INFO L225 Difference]: With dead ends: 484 [2018-07-25 08:36:41,305 INFO L226 Difference]: Without dead ends: 482 [2018-07-25 08:36:41,305 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:36:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-07-25 08:36:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2018-07-25 08:36:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-07-25 08:36:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 739 transitions. [2018-07-25 08:36:41,537 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 739 transitions. Word has length 15 [2018-07-25 08:36:41,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:41,537 INFO L472 AbstractCegarLoop]: Abstraction has 442 states and 739 transitions. [2018-07-25 08:36:41,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 739 transitions. [2018-07-25 08:36:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:41,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:41,538 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:41,539 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:41,539 INFO L82 PathProgramCache]: Analyzing trace with hash -750529310, now seen corresponding path program 1 times [2018-07-25 08:36:41,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:41,568 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:41,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:41,569 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:41,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:41,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:41,570 INFO L87 Difference]: Start difference. First operand 442 states and 739 transitions. Second operand 10 states. [2018-07-25 08:36:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:41,897 INFO L93 Difference]: Finished difference Result 465 states and 766 transitions. [2018-07-25 08:36:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:41,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:41,900 INFO L225 Difference]: With dead ends: 465 [2018-07-25 08:36:41,900 INFO L226 Difference]: Without dead ends: 464 [2018-07-25 08:36:41,900 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-07-25 08:36:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 451. [2018-07-25 08:36:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-25 08:36:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 754 transitions. [2018-07-25 08:36:42,184 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 754 transitions. Word has length 15 [2018-07-25 08:36:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:42,184 INFO L472 AbstractCegarLoop]: Abstraction has 451 states and 754 transitions. [2018-07-25 08:36:42,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:42,184 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 754 transitions. [2018-07-25 08:36:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:42,185 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:42,185 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:42,186 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash -215212996, now seen corresponding path program 1 times [2018-07-25 08:36:42,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:42,202 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:42,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:42,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:42,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:42,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:42,203 INFO L87 Difference]: Start difference. First operand 451 states and 754 transitions. Second operand 10 states. [2018-07-25 08:36:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:42,618 INFO L93 Difference]: Finished difference Result 518 states and 855 transitions. [2018-07-25 08:36:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:36:42,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:42,621 INFO L225 Difference]: With dead ends: 518 [2018-07-25 08:36:42,622 INFO L226 Difference]: Without dead ends: 516 [2018-07-25 08:36:42,622 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-25 08:36:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2018-07-25 08:36:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-25 08:36:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 781 transitions. [2018-07-25 08:36:42,835 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 781 transitions. Word has length 15 [2018-07-25 08:36:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:42,835 INFO L472 AbstractCegarLoop]: Abstraction has 467 states and 781 transitions. [2018-07-25 08:36:42,835 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 781 transitions. [2018-07-25 08:36:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:42,836 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:42,836 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:42,837 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -494290335, now seen corresponding path program 1 times [2018-07-25 08:36:42,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:42,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:42,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:42,853 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:42,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:42,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:42,853 INFO L87 Difference]: Start difference. First operand 467 states and 781 transitions. Second operand 10 states. [2018-07-25 08:36:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:43,175 INFO L93 Difference]: Finished difference Result 513 states and 856 transitions. [2018-07-25 08:36:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:43,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:43,178 INFO L225 Difference]: With dead ends: 513 [2018-07-25 08:36:43,179 INFO L226 Difference]: Without dead ends: 512 [2018-07-25 08:36:43,179 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:36:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-07-25 08:36:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 492. [2018-07-25 08:36:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-07-25 08:36:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 823 transitions. [2018-07-25 08:36:43,422 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 823 transitions. Word has length 15 [2018-07-25 08:36:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:43,422 INFO L472 AbstractCegarLoop]: Abstraction has 492 states and 823 transitions. [2018-07-25 08:36:43,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 823 transitions. [2018-07-25 08:36:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:43,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:43,423 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:43,424 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1511388970, now seen corresponding path program 2 times [2018-07-25 08:36:43,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:43,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:43,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:43,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:43,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:43,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:43,441 INFO L87 Difference]: Start difference. First operand 492 states and 823 transitions. Second operand 11 states. [2018-07-25 08:36:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:43,898 INFO L93 Difference]: Finished difference Result 571 states and 939 transitions. [2018-07-25 08:36:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:43,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:43,902 INFO L225 Difference]: With dead ends: 571 [2018-07-25 08:36:43,902 INFO L226 Difference]: Without dead ends: 570 [2018-07-25 08:36:43,903 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:36:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-07-25 08:36:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 512. [2018-07-25 08:36:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-25 08:36:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 860 transitions. [2018-07-25 08:36:44,166 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 860 transitions. Word has length 15 [2018-07-25 08:36:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:44,166 INFO L472 AbstractCegarLoop]: Abstraction has 512 states and 860 transitions. [2018-07-25 08:36:44,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 860 transitions. [2018-07-25 08:36:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:44,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:44,167 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:44,168 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-07-25 08:36:44,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:44,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:44,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:44,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:44,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:44,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:44,185 INFO L87 Difference]: Start difference. First operand 512 states and 860 transitions. Second operand 10 states. [2018-07-25 08:36:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:44,584 INFO L93 Difference]: Finished difference Result 583 states and 963 transitions. [2018-07-25 08:36:44,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:36:44,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:44,587 INFO L225 Difference]: With dead ends: 583 [2018-07-25 08:36:44,588 INFO L226 Difference]: Without dead ends: 581 [2018-07-25 08:36:44,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-07-25 08:36:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 524. [2018-07-25 08:36:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-25 08:36:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 881 transitions. [2018-07-25 08:36:44,802 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 881 transitions. Word has length 15 [2018-07-25 08:36:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:44,802 INFO L472 AbstractCegarLoop]: Abstraction has 524 states and 881 transitions. [2018-07-25 08:36:44,803 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 881 transitions. [2018-07-25 08:36:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:44,805 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:44,805 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:44,805 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1502800801, now seen corresponding path program 1 times [2018-07-25 08:36:44,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:44,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:44,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:44,826 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:44,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:44,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:44,826 INFO L87 Difference]: Start difference. First operand 524 states and 881 transitions. Second operand 11 states. [2018-07-25 08:36:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:45,428 INFO L93 Difference]: Finished difference Result 737 states and 1215 transitions. [2018-07-25 08:36:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:36:45,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:45,432 INFO L225 Difference]: With dead ends: 737 [2018-07-25 08:36:45,432 INFO L226 Difference]: Without dead ends: 736 [2018-07-25 08:36:45,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:36:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-07-25 08:36:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 623. [2018-07-25 08:36:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-07-25 08:36:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1052 transitions. [2018-07-25 08:36:45,822 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1052 transitions. Word has length 15 [2018-07-25 08:36:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:45,822 INFO L472 AbstractCegarLoop]: Abstraction has 623 states and 1052 transitions. [2018-07-25 08:36:45,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1052 transitions. [2018-07-25 08:36:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:45,823 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:45,824 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:36:45,824 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1502802083, now seen corresponding path program 1 times [2018-07-25 08:36:45,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:45,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:45,836 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:36:45,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:36:45,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:36:45,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:36:45,837 INFO L87 Difference]: Start difference. First operand 623 states and 1052 transitions. Second operand 9 states. [2018-07-25 08:36:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:46,357 INFO L93 Difference]: Finished difference Result 819 states and 1364 transitions. [2018-07-25 08:36:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:36:46,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-07-25 08:36:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:46,362 INFO L225 Difference]: With dead ends: 819 [2018-07-25 08:36:46,362 INFO L226 Difference]: Without dead ends: 817 [2018-07-25 08:36:46,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:36:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-07-25 08:36:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 600. [2018-07-25 08:36:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-07-25 08:36:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1013 transitions. [2018-07-25 08:36:46,712 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1013 transitions. Word has length 15 [2018-07-25 08:36:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:46,712 INFO L472 AbstractCegarLoop]: Abstraction has 600 states and 1013 transitions. [2018-07-25 08:36:46,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:36:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1013 transitions. [2018-07-25 08:36:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:46,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:46,714 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:46,714 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash -708989572, now seen corresponding path program 1 times [2018-07-25 08:36:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:46,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:46,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:46,732 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:46,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:46,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:46,733 INFO L87 Difference]: Start difference. First operand 600 states and 1013 transitions. Second operand 11 states. [2018-07-25 08:36:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:47,173 INFO L93 Difference]: Finished difference Result 638 states and 1059 transitions. [2018-07-25 08:36:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:47,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:47,176 INFO L225 Difference]: With dead ends: 638 [2018-07-25 08:36:47,177 INFO L226 Difference]: Without dead ends: 637 [2018-07-25 08:36:47,177 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:36:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-07-25 08:36:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 587. [2018-07-25 08:36:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-25 08:36:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-25 08:36:47,509 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-25 08:36:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:47,510 INFO L472 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-25 08:36:47,510 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-25 08:36:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:47,511 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:47,511 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:47,511 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash -708189250, now seen corresponding path program 1 times [2018-07-25 08:36:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:47,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:47,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:47,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:47,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:47,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:47,527 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-25 08:36:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:47,987 INFO L93 Difference]: Finished difference Result 642 states and 1067 transitions. [2018-07-25 08:36:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:36:47,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:47,991 INFO L225 Difference]: With dead ends: 642 [2018-07-25 08:36:47,991 INFO L226 Difference]: Without dead ends: 640 [2018-07-25 08:36:47,993 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:36:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-25 08:36:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 587. [2018-07-25 08:36:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-07-25 08:36:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 989 transitions. [2018-07-25 08:36:48,228 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 989 transitions. Word has length 15 [2018-07-25 08:36:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:48,228 INFO L472 AbstractCegarLoop]: Abstraction has 587 states and 989 transitions. [2018-07-25 08:36:48,228 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 989 transitions. [2018-07-25 08:36:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:48,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:48,229 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:48,230 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1511308848, now seen corresponding path program 2 times [2018-07-25 08:36:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:48,240 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:48,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:48,241 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:36:48,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:36:48,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:36:48,241 INFO L87 Difference]: Start difference. First operand 587 states and 989 transitions. Second operand 10 states. [2018-07-25 08:36:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:48,558 INFO L93 Difference]: Finished difference Result 610 states and 1020 transitions. [2018-07-25 08:36:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:36:48,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-07-25 08:36:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:48,561 INFO L225 Difference]: With dead ends: 610 [2018-07-25 08:36:48,561 INFO L226 Difference]: Without dead ends: 609 [2018-07-25 08:36:48,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-07-25 08:36:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 578. [2018-07-25 08:36:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-07-25 08:36:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 974 transitions. [2018-07-25 08:36:48,827 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 974 transitions. Word has length 15 [2018-07-25 08:36:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:48,828 INFO L472 AbstractCegarLoop]: Abstraction has 578 states and 974 transitions. [2018-07-25 08:36:48,828 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:36:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 974 transitions. [2018-07-25 08:36:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:48,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:48,829 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:48,829 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:48,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1638227434, now seen corresponding path program 1 times [2018-07-25 08:36:48,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:48,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:48,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:48,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:48,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:48,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:48,845 INFO L87 Difference]: Start difference. First operand 578 states and 974 transitions. Second operand 11 states. [2018-07-25 08:36:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:49,229 INFO L93 Difference]: Finished difference Result 633 states and 1050 transitions. [2018-07-25 08:36:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:36:49,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:49,232 INFO L225 Difference]: With dead ends: 633 [2018-07-25 08:36:49,232 INFO L226 Difference]: Without dead ends: 631 [2018-07-25 08:36:49,233 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:36:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-07-25 08:36:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 591. [2018-07-25 08:36:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-07-25 08:36:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 995 transitions. [2018-07-25 08:36:49,487 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 995 transitions. Word has length 15 [2018-07-25 08:36:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:49,487 INFO L472 AbstractCegarLoop]: Abstraction has 591 states and 995 transitions. [2018-07-25 08:36:49,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 995 transitions. [2018-07-25 08:36:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:49,491 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:49,491 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:49,492 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash 553313350, now seen corresponding path program 1 times [2018-07-25 08:36:49,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:49,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:49,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:49,515 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:49,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:49,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:49,516 INFO L87 Difference]: Start difference. First operand 591 states and 995 transitions. Second operand 11 states. [2018-07-25 08:36:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:49,840 INFO L93 Difference]: Finished difference Result 620 states and 1034 transitions. [2018-07-25 08:36:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:49,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:49,843 INFO L225 Difference]: With dead ends: 620 [2018-07-25 08:36:49,843 INFO L226 Difference]: Without dead ends: 619 [2018-07-25 08:36:49,844 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-07-25 08:36:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 596. [2018-07-25 08:36:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-07-25 08:36:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1004 transitions. [2018-07-25 08:36:50,094 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1004 transitions. Word has length 15 [2018-07-25 08:36:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:50,094 INFO L472 AbstractCegarLoop]: Abstraction has 596 states and 1004 transitions. [2018-07-25 08:36:50,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1004 transitions. [2018-07-25 08:36:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:36:50,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:50,096 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-07-25 08:36:50,096 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:50,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1657460349, now seen corresponding path program 1 times [2018-07-25 08:36:50,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:50,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:50,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:36:50,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:36:50,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:36:50,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:36:50,115 INFO L87 Difference]: Start difference. First operand 596 states and 1004 transitions. Second operand 11 states. [2018-07-25 08:36:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:50,383 INFO L93 Difference]: Finished difference Result 601 states and 1009 transitions. [2018-07-25 08:36:50,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:36:50,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-07-25 08:36:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:50,386 INFO L225 Difference]: With dead ends: 601 [2018-07-25 08:36:50,386 INFO L226 Difference]: Without dead ends: 599 [2018-07-25 08:36:50,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:36:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-25 08:36:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 590. [2018-07-25 08:36:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-07-25 08:36:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 994 transitions. [2018-07-25 08:36:50,612 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 994 transitions. Word has length 15 [2018-07-25 08:36:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:50,613 INFO L472 AbstractCegarLoop]: Abstraction has 590 states and 994 transitions. [2018-07-25 08:36:50,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:36:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 994 transitions. [2018-07-25 08:36:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:50,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:50,614 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:50,614 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash -616146153, now seen corresponding path program 3 times [2018-07-25 08:36:50,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:50,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:50,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:50,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:50,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:50,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:50,623 INFO L87 Difference]: Start difference. First operand 590 states and 994 transitions. Second operand 8 states. [2018-07-25 08:36:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,028 INFO L93 Difference]: Finished difference Result 652 states and 1080 transitions. [2018-07-25 08:36:51,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:51,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,032 INFO L225 Difference]: With dead ends: 652 [2018-07-25 08:36:51,032 INFO L226 Difference]: Without dead ends: 650 [2018-07-25 08:36:51,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-07-25 08:36:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 534. [2018-07-25 08:36:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-07-25 08:36:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 901 transitions. [2018-07-25 08:36:51,286 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 901 transitions. Word has length 16 [2018-07-25 08:36:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:51,286 INFO L472 AbstractCegarLoop]: Abstraction has 534 states and 901 transitions. [2018-07-25 08:36:51,286 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 901 transitions. [2018-07-25 08:36:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:51,287 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:51,287 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:51,288 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757577, now seen corresponding path program 4 times [2018-07-25 08:36:51,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:51,296 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:51,296 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:51,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:51,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:51,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:51,297 INFO L87 Difference]: Start difference. First operand 534 states and 901 transitions. Second operand 8 states. [2018-07-25 08:36:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:51,721 INFO L93 Difference]: Finished difference Result 587 states and 970 transitions. [2018-07-25 08:36:51,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:51,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:51,726 INFO L225 Difference]: With dead ends: 587 [2018-07-25 08:36:51,726 INFO L226 Difference]: Without dead ends: 585 [2018-07-25 08:36:51,727 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-07-25 08:36:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 518. [2018-07-25 08:36:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-25 08:36:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-25 08:36:52,015 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-25 08:36:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,015 INFO L472 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-25 08:36:52,015 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-25 08:36:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:52,017 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,017 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,017 INFO L415 AbstractCegarLoop]: === Iteration 68 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-07-25 08:36:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:52,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:52,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:52,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:52,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:52,028 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-25 08:36:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:52,438 INFO L93 Difference]: Finished difference Result 599 states and 990 transitions. [2018-07-25 08:36:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:52,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:52,441 INFO L225 Difference]: With dead ends: 599 [2018-07-25 08:36:52,441 INFO L226 Difference]: Without dead ends: 597 [2018-07-25 08:36:52,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-07-25 08:36:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 523. [2018-07-25 08:36:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-07-25 08:36:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 880 transitions. [2018-07-25 08:36:52,666 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 880 transitions. Word has length 16 [2018-07-25 08:36:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:52,666 INFO L472 AbstractCegarLoop]: Abstraction has 523 states and 880 transitions. [2018-07-25 08:36:52,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 880 transitions. [2018-07-25 08:36:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:52,667 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:52,667 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:52,667 INFO L415 AbstractCegarLoop]: === Iteration 69 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-07-25 08:36:52,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:52,675 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:52,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:52,675 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:52,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:52,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:52,676 INFO L87 Difference]: Start difference. First operand 523 states and 880 transitions. Second operand 8 states. [2018-07-25 08:36:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:53,008 INFO L93 Difference]: Finished difference Result 581 states and 960 transitions. [2018-07-25 08:36:53,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:53,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:53,011 INFO L225 Difference]: With dead ends: 581 [2018-07-25 08:36:53,011 INFO L226 Difference]: Without dead ends: 579 [2018-07-25 08:36:53,012 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-25 08:36:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-25 08:36:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-25 08:36:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-25 08:36:53,233 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-25 08:36:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:53,234 INFO L472 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-25 08:36:53,234 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-25 08:36:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:53,234 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:53,235 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:53,235 INFO L415 AbstractCegarLoop]: === Iteration 70 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:53,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-07-25 08:36:53,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:53,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:53,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:53,244 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:53,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:53,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:53,245 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-25 08:36:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:53,567 INFO L93 Difference]: Finished difference Result 575 states and 954 transitions. [2018-07-25 08:36:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:53,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:53,570 INFO L225 Difference]: With dead ends: 575 [2018-07-25 08:36:53,570 INFO L226 Difference]: Without dead ends: 573 [2018-07-25 08:36:53,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:36:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-25 08:36:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 521. [2018-07-25 08:36:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-07-25 08:36:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 877 transitions. [2018-07-25 08:36:53,796 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 877 transitions. Word has length 16 [2018-07-25 08:36:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:53,796 INFO L472 AbstractCegarLoop]: Abstraction has 521 states and 877 transitions. [2018-07-25 08:36:53,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 877 transitions. [2018-07-25 08:36:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:53,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:53,797 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:53,797 INFO L415 AbstractCegarLoop]: === Iteration 71 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-07-25 08:36:53,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:53,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:53,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:53,806 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:53,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:53,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:53,807 INFO L87 Difference]: Start difference. First operand 521 states and 877 transitions. Second operand 8 states. [2018-07-25 08:36:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:54,150 INFO L93 Difference]: Finished difference Result 581 states and 961 transitions. [2018-07-25 08:36:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:54,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:54,152 INFO L225 Difference]: With dead ends: 581 [2018-07-25 08:36:54,153 INFO L226 Difference]: Without dead ends: 579 [2018-07-25 08:36:54,153 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-25 08:36:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 518. [2018-07-25 08:36:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-07-25 08:36:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 872 transitions. [2018-07-25 08:36:54,373 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 872 transitions. Word has length 16 [2018-07-25 08:36:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:54,373 INFO L472 AbstractCegarLoop]: Abstraction has 518 states and 872 transitions. [2018-07-25 08:36:54,373 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 872 transitions. [2018-07-25 08:36:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:54,374 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:54,374 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:54,374 INFO L415 AbstractCegarLoop]: === Iteration 72 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 472492110, now seen corresponding path program 3 times [2018-07-25 08:36:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:54,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:54,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:54,383 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:54,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:54,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:54,383 INFO L87 Difference]: Start difference. First operand 518 states and 872 transitions. Second operand 8 states. [2018-07-25 08:36:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:54,697 INFO L93 Difference]: Finished difference Result 573 states and 946 transitions. [2018-07-25 08:36:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:54,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:54,699 INFO L225 Difference]: With dead ends: 573 [2018-07-25 08:36:54,699 INFO L226 Difference]: Without dead ends: 571 [2018-07-25 08:36:54,700 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:36:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-07-25 08:36:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 512. [2018-07-25 08:36:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-07-25 08:36:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 862 transitions. [2018-07-25 08:36:54,953 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 862 transitions. Word has length 16 [2018-07-25 08:36:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:54,954 INFO L472 AbstractCegarLoop]: Abstraction has 512 states and 862 transitions. [2018-07-25 08:36:54,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 862 transitions. [2018-07-25 08:36:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:36:54,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:54,954 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:54,955 INFO L415 AbstractCegarLoop]: === Iteration 73 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:54,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1974571456, now seen corresponding path program 4 times [2018-07-25 08:36:54,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:54,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:54,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:36:54,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:36:54,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:36:54,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:36:54,962 INFO L87 Difference]: Start difference. First operand 512 states and 862 transitions. Second operand 8 states. [2018-07-25 08:36:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:55,338 INFO L93 Difference]: Finished difference Result 564 states and 935 transitions. [2018-07-25 08:36:55,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:55,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 08:36:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:55,341 INFO L225 Difference]: With dead ends: 564 [2018-07-25 08:36:55,341 INFO L226 Difference]: Without dead ends: 562 [2018-07-25 08:36:55,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:36:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-07-25 08:36:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 452. [2018-07-25 08:36:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-07-25 08:36:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 761 transitions. [2018-07-25 08:36:55,561 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 761 transitions. Word has length 16 [2018-07-25 08:36:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:55,561 INFO L472 AbstractCegarLoop]: Abstraction has 452 states and 761 transitions. [2018-07-25 08:36:55,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:36:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 761 transitions. [2018-07-25 08:36:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:55,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:55,562 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:55,562 INFO L415 AbstractCegarLoop]: === Iteration 74 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1651842093, now seen corresponding path program 1 times [2018-07-25 08:36:55,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:55,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:55,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:36:55,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:36:55,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:36:55,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:55,584 INFO L87 Difference]: Start difference. First operand 452 states and 761 transitions. Second operand 13 states. [2018-07-25 08:36:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:55,950 INFO L93 Difference]: Finished difference Result 480 states and 791 transitions. [2018-07-25 08:36:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:36:55,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 08:36:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:55,952 INFO L225 Difference]: With dead ends: 480 [2018-07-25 08:36:55,952 INFO L226 Difference]: Without dead ends: 479 [2018-07-25 08:36:55,952 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:36:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-25 08:36:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2018-07-25 08:36:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-07-25 08:36:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 722 transitions. [2018-07-25 08:36:56,166 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 722 transitions. Word has length 17 [2018-07-25 08:36:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:56,166 INFO L472 AbstractCegarLoop]: Abstraction has 430 states and 722 transitions. [2018-07-25 08:36:56,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:36:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 722 transitions. [2018-07-25 08:36:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:56,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:56,167 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:56,168 INFO L415 AbstractCegarLoop]: === Iteration 75 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash 692781, now seen corresponding path program 1 times [2018-07-25 08:36:56,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:56,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:56,180 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:56,180 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:56,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:56,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:56,181 INFO L87 Difference]: Start difference. First operand 430 states and 722 transitions. Second operand 12 states. [2018-07-25 08:36:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:56,531 INFO L93 Difference]: Finished difference Result 545 states and 906 transitions. [2018-07-25 08:36:56,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:36:56,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 08:36:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:56,533 INFO L225 Difference]: With dead ends: 545 [2018-07-25 08:36:56,533 INFO L226 Difference]: Without dead ends: 544 [2018-07-25 08:36:56,533 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:36:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-07-25 08:36:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 451. [2018-07-25 08:36:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-25 08:36:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 757 transitions. [2018-07-25 08:36:56,767 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 757 transitions. Word has length 17 [2018-07-25 08:36:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:56,767 INFO L472 AbstractCegarLoop]: Abstraction has 451 states and 757 transitions. [2018-07-25 08:36:56,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 757 transitions. [2018-07-25 08:36:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:56,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:56,768 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:56,768 INFO L415 AbstractCegarLoop]: === Iteration 76 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 337396676, now seen corresponding path program 1 times [2018-07-25 08:36:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:56,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:56,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:36:56,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:56,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:56,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:56,784 INFO L87 Difference]: Start difference. First operand 451 states and 757 transitions. Second operand 12 states. [2018-07-25 08:36:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:57,049 INFO L93 Difference]: Finished difference Result 458 states and 767 transitions. [2018-07-25 08:36:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:36:57,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 08:36:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:57,051 INFO L225 Difference]: With dead ends: 458 [2018-07-25 08:36:57,051 INFO L226 Difference]: Without dead ends: 457 [2018-07-25 08:36:57,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:36:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-07-25 08:36:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-07-25 08:36:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-07-25 08:36:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 709 transitions. [2018-07-25 08:36:57,255 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 709 transitions. Word has length 17 [2018-07-25 08:36:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:57,256 INFO L472 AbstractCegarLoop]: Abstraction has 423 states and 709 transitions. [2018-07-25 08:36:57,256 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 709 transitions. [2018-07-25 08:36:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:57,256 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:57,256 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:57,257 INFO L415 AbstractCegarLoop]: === Iteration 77 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:57,257 INFO L82 PathProgramCache]: Analyzing trace with hash -449446913, now seen corresponding path program 2 times [2018-07-25 08:36:57,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:57,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:57,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:36:57,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:36:57,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:36:57,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:57,278 INFO L87 Difference]: Start difference. First operand 423 states and 709 transitions. Second operand 13 states. [2018-07-25 08:36:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:57,682 INFO L93 Difference]: Finished difference Result 508 states and 829 transitions. [2018-07-25 08:36:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:36:57,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 08:36:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:57,683 INFO L225 Difference]: With dead ends: 508 [2018-07-25 08:36:57,683 INFO L226 Difference]: Without dead ends: 507 [2018-07-25 08:36:57,684 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:36:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-07-25 08:36:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2018-07-25 08:36:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-07-25 08:36:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 736 transitions. [2018-07-25 08:36:57,915 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 736 transitions. Word has length 17 [2018-07-25 08:36:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:57,915 INFO L472 AbstractCegarLoop]: Abstraction has 440 states and 736 transitions. [2018-07-25 08:36:57,915 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:36:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 736 transitions. [2018-07-25 08:36:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:57,916 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:57,916 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-07-25 08:36:57,916 INFO L415 AbstractCegarLoop]: === Iteration 78 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1940633158, now seen corresponding path program 1 times [2018-07-25 08:36:57,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:57,938 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:57,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:57,938 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:36:57,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:36:57,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:57,938 INFO L87 Difference]: Start difference. First operand 440 states and 736 transitions. Second operand 13 states. [2018-07-25 08:36:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:58,213 INFO L93 Difference]: Finished difference Result 446 states and 743 transitions. [2018-07-25 08:36:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:36:58,213 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 08:36:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:58,214 INFO L225 Difference]: With dead ends: 446 [2018-07-25 08:36:58,214 INFO L226 Difference]: Without dead ends: 445 [2018-07-25 08:36:58,215 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:36:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-07-25 08:36:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 424. [2018-07-25 08:36:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-07-25 08:36:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 709 transitions. [2018-07-25 08:36:58,498 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 709 transitions. Word has length 17 [2018-07-25 08:36:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:58,498 INFO L472 AbstractCegarLoop]: Abstraction has 424 states and 709 transitions. [2018-07-25 08:36:58,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:36:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 709 transitions. [2018-07-25 08:36:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:58,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:58,499 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:58,499 INFO L415 AbstractCegarLoop]: === Iteration 79 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash -453832993, now seen corresponding path program 1 times [2018-07-25 08:36:58,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:58,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:58,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:58,516 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:58,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:58,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:58,517 INFO L87 Difference]: Start difference. First operand 424 states and 709 transitions. Second operand 12 states. [2018-07-25 08:36:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:58,923 INFO L93 Difference]: Finished difference Result 505 states and 821 transitions. [2018-07-25 08:36:58,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:36:58,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 08:36:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:58,924 INFO L225 Difference]: With dead ends: 505 [2018-07-25 08:36:58,924 INFO L226 Difference]: Without dead ends: 504 [2018-07-25 08:36:58,925 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:36:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-07-25 08:36:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 453. [2018-07-25 08:36:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-07-25 08:36:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 755 transitions. [2018-07-25 08:36:59,156 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 755 transitions. Word has length 17 [2018-07-25 08:36:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:59,157 INFO L472 AbstractCegarLoop]: Abstraction has 453 states and 755 transitions. [2018-07-25 08:36:59,157 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 755 transitions. [2018-07-25 08:36:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:59,158 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:59,158 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:59,158 INFO L415 AbstractCegarLoop]: === Iteration 80 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1757610527, now seen corresponding path program 1 times [2018-07-25 08:36:59,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:59,174 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:59,174 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:36:59,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:36:59,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:36:59,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:36:59,175 INFO L87 Difference]: Start difference. First operand 453 states and 755 transitions. Second operand 12 states. [2018-07-25 08:36:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:36:59,620 INFO L93 Difference]: Finished difference Result 516 states and 838 transitions. [2018-07-25 08:36:59,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:36:59,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 08:36:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:36:59,622 INFO L225 Difference]: With dead ends: 516 [2018-07-25 08:36:59,622 INFO L226 Difference]: Without dead ends: 515 [2018-07-25 08:36:59,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:36:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-07-25 08:36:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 449. [2018-07-25 08:36:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-25 08:36:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 748 transitions. [2018-07-25 08:36:59,881 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 748 transitions. Word has length 17 [2018-07-25 08:36:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:36:59,881 INFO L472 AbstractCegarLoop]: Abstraction has 449 states and 748 transitions. [2018-07-25 08:36:59,881 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:36:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 748 transitions. [2018-07-25 08:36:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:36:59,882 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:36:59,882 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:36:59,882 INFO L415 AbstractCegarLoop]: === Iteration 81 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:36:59,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1709007603, now seen corresponding path program 1 times [2018-07-25 08:36:59,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:36:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:36:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:36:59,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:36:59,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:36:59,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:36:59,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:36:59,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:36:59,899 INFO L87 Difference]: Start difference. First operand 449 states and 748 transitions. Second operand 13 states. [2018-07-25 08:37:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:00,310 INFO L93 Difference]: Finished difference Result 526 states and 863 transitions. [2018-07-25 08:37:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:00,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-07-25 08:37:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:00,311 INFO L225 Difference]: With dead ends: 526 [2018-07-25 08:37:00,311 INFO L226 Difference]: Without dead ends: 524 [2018-07-25 08:37:00,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-07-25 08:37:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 455. [2018-07-25 08:37:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-07-25 08:37:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 760 transitions. [2018-07-25 08:37:00,600 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 760 transitions. Word has length 17 [2018-07-25 08:37:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:00,600 INFO L472 AbstractCegarLoop]: Abstraction has 455 states and 760 transitions. [2018-07-25 08:37:00,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 760 transitions. [2018-07-25 08:37:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:37:00,601 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:00,601 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:00,601 INFO L415 AbstractCegarLoop]: === Iteration 82 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -840518133, now seen corresponding path program 2 times [2018-07-25 08:37:00,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:00,614 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:00,615 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:00,615 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:00,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:00,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:00,615 INFO L87 Difference]: Start difference. First operand 455 states and 760 transitions. Second operand 12 states. [2018-07-25 08:37:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:00,945 INFO L93 Difference]: Finished difference Result 499 states and 825 transitions. [2018-07-25 08:37:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:00,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-07-25 08:37:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:00,946 INFO L225 Difference]: With dead ends: 499 [2018-07-25 08:37:00,946 INFO L226 Difference]: Without dead ends: 498 [2018-07-25 08:37:00,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-07-25 08:37:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 428. [2018-07-25 08:37:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-07-25 08:37:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 713 transitions. [2018-07-25 08:37:01,193 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 713 transitions. Word has length 17 [2018-07-25 08:37:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:01,193 INFO L472 AbstractCegarLoop]: Abstraction has 428 states and 713 transitions. [2018-07-25 08:37:01,193 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 713 transitions. [2018-07-25 08:37:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:01,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:01,194 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:01,194 INFO L415 AbstractCegarLoop]: === Iteration 83 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1270158156, now seen corresponding path program 1 times [2018-07-25 08:37:01,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:01,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:01,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:01,210 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:01,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:01,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:01,210 INFO L87 Difference]: Start difference. First operand 428 states and 713 transitions. Second operand 12 states. [2018-07-25 08:37:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:01,573 INFO L93 Difference]: Finished difference Result 491 states and 812 transitions. [2018-07-25 08:37:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:37:01,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:01,574 INFO L225 Difference]: With dead ends: 491 [2018-07-25 08:37:01,574 INFO L226 Difference]: Without dead ends: 490 [2018-07-25 08:37:01,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:37:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-07-25 08:37:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 466. [2018-07-25 08:37:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-25 08:37:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 779 transitions. [2018-07-25 08:37:01,858 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 779 transitions. Word has length 18 [2018-07-25 08:37:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:01,858 INFO L472 AbstractCegarLoop]: Abstraction has 466 states and 779 transitions. [2018-07-25 08:37:01,858 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 779 transitions. [2018-07-25 08:37:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:01,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:01,859 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:01,859 INFO L415 AbstractCegarLoop]: === Iteration 84 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -301522250, now seen corresponding path program 1 times [2018-07-25 08:37:01,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:01,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:01,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:01,871 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:01,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:01,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:01,872 INFO L87 Difference]: Start difference. First operand 466 states and 779 transitions. Second operand 12 states. [2018-07-25 08:37:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:02,374 INFO L93 Difference]: Finished difference Result 563 states and 925 transitions. [2018-07-25 08:37:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:02,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:02,375 INFO L225 Difference]: With dead ends: 563 [2018-07-25 08:37:02,375 INFO L226 Difference]: Without dead ends: 561 [2018-07-25 08:37:02,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-07-25 08:37:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 458. [2018-07-25 08:37:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-07-25 08:37:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 765 transitions. [2018-07-25 08:37:02,650 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 765 transitions. Word has length 18 [2018-07-25 08:37:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:02,650 INFO L472 AbstractCegarLoop]: Abstraction has 458 states and 765 transitions. [2018-07-25 08:37:02,650 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 765 transitions. [2018-07-25 08:37:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:02,651 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:02,651 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:02,652 INFO L415 AbstractCegarLoop]: === Iteration 85 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1503466215, now seen corresponding path program 1 times [2018-07-25 08:37:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:02,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:02,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:02,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:02,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:02,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:02,666 INFO L87 Difference]: Start difference. First operand 458 states and 765 transitions. Second operand 11 states. [2018-07-25 08:37:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:03,203 INFO L93 Difference]: Finished difference Result 513 states and 833 transitions. [2018-07-25 08:37:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:37:03,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:03,204 INFO L225 Difference]: With dead ends: 513 [2018-07-25 08:37:03,204 INFO L226 Difference]: Without dead ends: 511 [2018-07-25 08:37:03,205 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:37:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-07-25 08:37:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 459. [2018-07-25 08:37:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-25 08:37:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 767 transitions. [2018-07-25 08:37:03,495 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 767 transitions. Word has length 18 [2018-07-25 08:37:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:03,496 INFO L472 AbstractCegarLoop]: Abstraction has 459 states and 767 transitions. [2018-07-25 08:37:03,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 767 transitions. [2018-07-25 08:37:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:03,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:03,497 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:03,497 INFO L415 AbstractCegarLoop]: === Iteration 86 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172812, now seen corresponding path program 2 times [2018-07-25 08:37:03,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:03,511 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:03,511 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:03,511 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:03,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:03,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:03,512 INFO L87 Difference]: Start difference. First operand 459 states and 767 transitions. Second operand 13 states. [2018-07-25 08:37:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:03,927 INFO L93 Difference]: Finished difference Result 507 states and 835 transitions. [2018-07-25 08:37:03,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:03,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 08:37:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:03,928 INFO L225 Difference]: With dead ends: 507 [2018-07-25 08:37:03,928 INFO L226 Difference]: Without dead ends: 506 [2018-07-25 08:37:03,929 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-07-25 08:37:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 466. [2018-07-25 08:37:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-25 08:37:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 780 transitions. [2018-07-25 08:37:04,196 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 780 transitions. Word has length 18 [2018-07-25 08:37:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:04,196 INFO L472 AbstractCegarLoop]: Abstraction has 466 states and 780 transitions. [2018-07-25 08:37:04,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 780 transitions. [2018-07-25 08:37:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:04,197 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:04,198 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:04,198 INFO L415 AbstractCegarLoop]: === Iteration 87 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1224172524, now seen corresponding path program 1 times [2018-07-25 08:37:04,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:04,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:04,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:04,213 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:04,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:04,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:04,214 INFO L87 Difference]: Start difference. First operand 466 states and 780 transitions. Second operand 11 states. [2018-07-25 08:37:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:04,616 INFO L93 Difference]: Finished difference Result 518 states and 845 transitions. [2018-07-25 08:37:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:04,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:04,618 INFO L225 Difference]: With dead ends: 518 [2018-07-25 08:37:04,618 INFO L226 Difference]: Without dead ends: 516 [2018-07-25 08:37:04,618 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-07-25 08:37:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 469. [2018-07-25 08:37:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-25 08:37:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 783 transitions. [2018-07-25 08:37:04,958 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 783 transitions. Word has length 18 [2018-07-25 08:37:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:04,959 INFO L472 AbstractCegarLoop]: Abstraction has 469 states and 783 transitions. [2018-07-25 08:37:04,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 783 transitions. [2018-07-25 08:37:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:04,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:04,959 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:04,960 INFO L415 AbstractCegarLoop]: === Iteration 88 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1215585637, now seen corresponding path program 1 times [2018-07-25 08:37:04,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:04,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:04,972 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:04,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:04,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:04,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:04,973 INFO L87 Difference]: Start difference. First operand 469 states and 783 transitions. Second operand 11 states. [2018-07-25 08:37:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:05,478 INFO L93 Difference]: Finished difference Result 531 states and 868 transitions. [2018-07-25 08:37:05,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:05,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:05,480 INFO L225 Difference]: With dead ends: 531 [2018-07-25 08:37:05,480 INFO L226 Difference]: Without dead ends: 529 [2018-07-25 08:37:05,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-25 08:37:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 470. [2018-07-25 08:37:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-07-25 08:37:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 785 transitions. [2018-07-25 08:37:05,830 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 785 transitions. Word has length 18 [2018-07-25 08:37:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:05,830 INFO L472 AbstractCegarLoop]: Abstraction has 470 states and 785 transitions. [2018-07-25 08:37:05,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 785 transitions. [2018-07-25 08:37:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:05,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:05,831 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:05,831 INFO L415 AbstractCegarLoop]: === Iteration 89 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-07-25 08:37:05,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:05,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:05,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:05,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:05,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:05,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:05,845 INFO L87 Difference]: Start difference. First operand 470 states and 785 transitions. Second operand 12 states. [2018-07-25 08:37:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:06,286 INFO L93 Difference]: Finished difference Result 545 states and 895 transitions. [2018-07-25 08:37:06,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:06,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:06,287 INFO L225 Difference]: With dead ends: 545 [2018-07-25 08:37:06,287 INFO L226 Difference]: Without dead ends: 543 [2018-07-25 08:37:06,288 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-25 08:37:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 474. [2018-07-25 08:37:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-07-25 08:37:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 791 transitions. [2018-07-25 08:37:06,778 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 791 transitions. Word has length 18 [2018-07-25 08:37:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:06,779 INFO L472 AbstractCegarLoop]: Abstraction has 474 states and 791 transitions. [2018-07-25 08:37:06,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 791 transitions. [2018-07-25 08:37:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:06,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:06,780 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:06,780 INFO L415 AbstractCegarLoop]: === Iteration 90 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1467012, now seen corresponding path program 1 times [2018-07-25 08:37:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:06,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:06,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:06,794 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:06,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:06,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:06,794 INFO L87 Difference]: Start difference. First operand 474 states and 791 transitions. Second operand 11 states. [2018-07-25 08:37:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:07,321 INFO L93 Difference]: Finished difference Result 634 states and 1037 transitions. [2018-07-25 08:37:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:07,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:07,324 INFO L225 Difference]: With dead ends: 634 [2018-07-25 08:37:07,324 INFO L226 Difference]: Without dead ends: 632 [2018-07-25 08:37:07,324 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-07-25 08:37:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 493. [2018-07-25 08:37:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-25 08:37:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 822 transitions. [2018-07-25 08:37:07,743 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 822 transitions. Word has length 18 [2018-07-25 08:37:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:07,743 INFO L472 AbstractCegarLoop]: Abstraction has 493 states and 822 transitions. [2018-07-25 08:37:07,743 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 822 transitions. [2018-07-25 08:37:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:07,743 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:07,744 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:07,744 INFO L415 AbstractCegarLoop]: === Iteration 91 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1846437006, now seen corresponding path program 1 times [2018-07-25 08:37:07,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:07,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:07,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:07,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:07,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:07,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:07,758 INFO L87 Difference]: Start difference. First operand 493 states and 822 transitions. Second operand 13 states. [2018-07-25 08:37:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:08,293 INFO L93 Difference]: Finished difference Result 574 states and 939 transitions. [2018-07-25 08:37:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:37:08,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-07-25 08:37:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:08,295 INFO L225 Difference]: With dead ends: 574 [2018-07-25 08:37:08,295 INFO L226 Difference]: Without dead ends: 573 [2018-07-25 08:37:08,296 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-07-25 08:37:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 491. [2018-07-25 08:37:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-07-25 08:37:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 817 transitions. [2018-07-25 08:37:08,788 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 817 transitions. Word has length 18 [2018-07-25 08:37:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:08,789 INFO L472 AbstractCegarLoop]: Abstraction has 491 states and 817 transitions. [2018-07-25 08:37:08,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 817 transitions. [2018-07-25 08:37:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:08,790 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:08,790 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:08,790 INFO L415 AbstractCegarLoop]: === Iteration 92 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1846436718, now seen corresponding path program 2 times [2018-07-25 08:37:08,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:08,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:08,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:08,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:08,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:08,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:08,804 INFO L87 Difference]: Start difference. First operand 491 states and 817 transitions. Second operand 11 states. [2018-07-25 08:37:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:09,315 INFO L93 Difference]: Finished difference Result 557 states and 901 transitions. [2018-07-25 08:37:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:37:09,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:09,316 INFO L225 Difference]: With dead ends: 557 [2018-07-25 08:37:09,317 INFO L226 Difference]: Without dead ends: 555 [2018-07-25 08:37:09,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-25 08:37:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 477. [2018-07-25 08:37:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-07-25 08:37:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 791 transitions. [2018-07-25 08:37:09,641 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 791 transitions. Word has length 18 [2018-07-25 08:37:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:09,642 INFO L472 AbstractCegarLoop]: Abstraction has 477 states and 791 transitions. [2018-07-25 08:37:09,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 791 transitions. [2018-07-25 08:37:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:09,642 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:09,642 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:09,643 INFO L415 AbstractCegarLoop]: === Iteration 93 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1837849831, now seen corresponding path program 1 times [2018-07-25 08:37:09,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:09,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:09,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:09,656 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:37:09,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:37:09,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:37:09,656 INFO L87 Difference]: Start difference. First operand 477 states and 791 transitions. Second operand 11 states. [2018-07-25 08:37:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:10,163 INFO L93 Difference]: Finished difference Result 557 states and 903 transitions. [2018-07-25 08:37:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:10,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:37:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:10,164 INFO L225 Difference]: With dead ends: 557 [2018-07-25 08:37:10,165 INFO L226 Difference]: Without dead ends: 555 [2018-07-25 08:37:10,165 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-25 08:37:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 467. [2018-07-25 08:37:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-07-25 08:37:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 775 transitions. [2018-07-25 08:37:10,647 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 775 transitions. Word has length 18 [2018-07-25 08:37:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:10,647 INFO L472 AbstractCegarLoop]: Abstraction has 467 states and 775 transitions. [2018-07-25 08:37:10,647 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:37:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 775 transitions. [2018-07-25 08:37:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:10,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:10,648 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:10,648 INFO L415 AbstractCegarLoop]: === Iteration 94 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1884609208, now seen corresponding path program 1 times [2018-07-25 08:37:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:10,660 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:10,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:10,661 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:10,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:10,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:10,661 INFO L87 Difference]: Start difference. First operand 467 states and 775 transitions. Second operand 12 states. [2018-07-25 08:37:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:11,173 INFO L93 Difference]: Finished difference Result 594 states and 971 transitions. [2018-07-25 08:37:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:11,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-07-25 08:37:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:11,174 INFO L225 Difference]: With dead ends: 594 [2018-07-25 08:37:11,174 INFO L226 Difference]: Without dead ends: 592 [2018-07-25 08:37:11,174 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-07-25 08:37:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 469. [2018-07-25 08:37:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-07-25 08:37:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 778 transitions. [2018-07-25 08:37:11,495 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 778 transitions. Word has length 18 [2018-07-25 08:37:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:11,495 INFO L472 AbstractCegarLoop]: Abstraction has 469 states and 778 transitions. [2018-07-25 08:37:11,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 778 transitions. [2018-07-25 08:37:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:11,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:11,496 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:11,496 INFO L415 AbstractCegarLoop]: === Iteration 95 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-07-25 08:37:11,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:11,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:11,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:11,507 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:11,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:11,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:11,507 INFO L87 Difference]: Start difference. First operand 469 states and 778 transitions. Second operand 10 states. [2018-07-25 08:37:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:11,965 INFO L93 Difference]: Finished difference Result 531 states and 864 transitions. [2018-07-25 08:37:11,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:11,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:11,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:11,966 INFO L225 Difference]: With dead ends: 531 [2018-07-25 08:37:11,966 INFO L226 Difference]: Without dead ends: 529 [2018-07-25 08:37:11,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:37:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-07-25 08:37:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 473. [2018-07-25 08:37:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-07-25 08:37:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 785 transitions. [2018-07-25 08:37:12,314 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 785 transitions. Word has length 18 [2018-07-25 08:37:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:12,314 INFO L472 AbstractCegarLoop]: Abstraction has 473 states and 785 transitions. [2018-07-25 08:37:12,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 785 transitions. [2018-07-25 08:37:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:12,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:12,315 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:12,315 INFO L415 AbstractCegarLoop]: === Iteration 96 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 589748198, now seen corresponding path program 1 times [2018-07-25 08:37:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:12,330 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:12,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:12,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:12,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:12,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:12,331 INFO L87 Difference]: Start difference. First operand 473 states and 785 transitions. Second operand 10 states. [2018-07-25 08:37:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:12,819 INFO L93 Difference]: Finished difference Result 578 states and 943 transitions. [2018-07-25 08:37:12,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:12,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:12,820 INFO L225 Difference]: With dead ends: 578 [2018-07-25 08:37:12,820 INFO L226 Difference]: Without dead ends: 576 [2018-07-25 08:37:12,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:37:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-25 08:37:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 496. [2018-07-25 08:37:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-07-25 08:37:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 824 transitions. [2018-07-25 08:37:13,199 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 824 transitions. Word has length 18 [2018-07-25 08:37:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:13,200 INFO L472 AbstractCegarLoop]: Abstraction has 496 states and 824 transitions. [2018-07-25 08:37:13,200 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 824 transitions. [2018-07-25 08:37:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:13,201 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:13,201 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:13,201 INFO L415 AbstractCegarLoop]: === Iteration 97 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash 581159259, now seen corresponding path program 1 times [2018-07-25 08:37:13,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:13,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:13,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:37:13,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:37:13,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:37:13,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:37:13,212 INFO L87 Difference]: Start difference. First operand 496 states and 824 transitions. Second operand 9 states. [2018-07-25 08:37:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:13,698 INFO L93 Difference]: Finished difference Result 551 states and 898 transitions. [2018-07-25 08:37:13,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:37:13,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-25 08:37:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:13,699 INFO L225 Difference]: With dead ends: 551 [2018-07-25 08:37:13,699 INFO L226 Difference]: Without dead ends: 549 [2018-07-25 08:37:13,699 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:37:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-07-25 08:37:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 500. [2018-07-25 08:37:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-07-25 08:37:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 828 transitions. [2018-07-25 08:37:14,058 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 828 transitions. Word has length 18 [2018-07-25 08:37:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:14,059 INFO L472 AbstractCegarLoop]: Abstraction has 500 states and 828 transitions. [2018-07-25 08:37:14,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:37:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 828 transitions. [2018-07-25 08:37:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:14,059 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:14,059 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:14,060 INFO L415 AbstractCegarLoop]: === Iteration 98 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1629830792, now seen corresponding path program 1 times [2018-07-25 08:37:14,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:14,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:14,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:14,072 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:14,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:14,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:14,072 INFO L87 Difference]: Start difference. First operand 500 states and 828 transitions. Second operand 10 states. [2018-07-25 08:37:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:14,580 INFO L93 Difference]: Finished difference Result 581 states and 944 transitions. [2018-07-25 08:37:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:37:14,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:14,581 INFO L225 Difference]: With dead ends: 581 [2018-07-25 08:37:14,581 INFO L226 Difference]: Without dead ends: 579 [2018-07-25 08:37:14,581 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-25 08:37:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 504. [2018-07-25 08:37:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-07-25 08:37:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 834 transitions. [2018-07-25 08:37:14,939 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 834 transitions. Word has length 18 [2018-07-25 08:37:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:14,940 INFO L472 AbstractCegarLoop]: Abstraction has 504 states and 834 transitions. [2018-07-25 08:37:14,940 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 834 transitions. [2018-07-25 08:37:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:14,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:14,940 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:14,941 INFO L415 AbstractCegarLoop]: === Iteration 99 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1655320734, now seen corresponding path program 2 times [2018-07-25 08:37:14,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:14,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:14,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:14,950 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:14,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:14,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:14,950 INFO L87 Difference]: Start difference. First operand 504 states and 834 transitions. Second operand 10 states. [2018-07-25 08:37:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:15,537 INFO L93 Difference]: Finished difference Result 630 states and 1024 transitions. [2018-07-25 08:37:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:37:15,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:15,538 INFO L225 Difference]: With dead ends: 630 [2018-07-25 08:37:15,538 INFO L226 Difference]: Without dead ends: 628 [2018-07-25 08:37:15,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-07-25 08:37:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 509. [2018-07-25 08:37:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-07-25 08:37:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 843 transitions. [2018-07-25 08:37:15,905 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 843 transitions. Word has length 18 [2018-07-25 08:37:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:15,905 INFO L472 AbstractCegarLoop]: Abstraction has 509 states and 843 transitions. [2018-07-25 08:37:15,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 843 transitions. [2018-07-25 08:37:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:15,906 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:15,906 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:15,907 INFO L415 AbstractCegarLoop]: === Iteration 100 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1646731795, now seen corresponding path program 2 times [2018-07-25 08:37:15,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:15,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:15,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:15,918 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:15,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:15,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:15,918 INFO L87 Difference]: Start difference. First operand 509 states and 843 transitions. Second operand 10 states. [2018-07-25 08:37:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:16,494 INFO L93 Difference]: Finished difference Result 620 states and 1007 transitions. [2018-07-25 08:37:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:37:16,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:16,495 INFO L225 Difference]: With dead ends: 620 [2018-07-25 08:37:16,495 INFO L226 Difference]: Without dead ends: 618 [2018-07-25 08:37:16,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:37:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-07-25 08:37:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 510. [2018-07-25 08:37:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-07-25 08:37:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 845 transitions. [2018-07-25 08:37:16,868 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 845 transitions. Word has length 18 [2018-07-25 08:37:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:16,868 INFO L472 AbstractCegarLoop]: Abstraction has 510 states and 845 transitions. [2018-07-25 08:37:16,869 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 845 transitions. [2018-07-25 08:37:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:16,869 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:16,870 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:16,870 INFO L415 AbstractCegarLoop]: === Iteration 101 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash -800331771, now seen corresponding path program 3 times [2018-07-25 08:37:16,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:16,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:16,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:16,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:16,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:16,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:16,884 INFO L87 Difference]: Start difference. First operand 510 states and 845 transitions. Second operand 10 states. [2018-07-25 08:37:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:17,534 INFO L93 Difference]: Finished difference Result 703 states and 1148 transitions. [2018-07-25 08:37:17,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:37:17,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:17,535 INFO L225 Difference]: With dead ends: 703 [2018-07-25 08:37:17,535 INFO L226 Difference]: Without dead ends: 701 [2018-07-25 08:37:17,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-07-25 08:37:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 530. [2018-07-25 08:37:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-07-25 08:37:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 879 transitions. [2018-07-25 08:37:17,912 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 879 transitions. Word has length 18 [2018-07-25 08:37:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:17,912 INFO L472 AbstractCegarLoop]: Abstraction has 530 states and 879 transitions. [2018-07-25 08:37:17,912 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 879 transitions. [2018-07-25 08:37:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:17,912 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:17,913 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:17,913 INFO L415 AbstractCegarLoop]: === Iteration 102 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1149501708, now seen corresponding path program 1 times [2018-07-25 08:37:17,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:17,922 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:17,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:17,923 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:17,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:17,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:17,923 INFO L87 Difference]: Start difference. First operand 530 states and 879 transitions. Second operand 10 states. [2018-07-25 08:37:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:18,475 INFO L93 Difference]: Finished difference Result 642 states and 1045 transitions. [2018-07-25 08:37:18,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:18,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:18,476 INFO L225 Difference]: With dead ends: 642 [2018-07-25 08:37:18,476 INFO L226 Difference]: Without dead ends: 640 [2018-07-25 08:37:18,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:37:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-07-25 08:37:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 524. [2018-07-25 08:37:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-07-25 08:37:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 869 transitions. [2018-07-25 08:37:18,863 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 869 transitions. Word has length 18 [2018-07-25 08:37:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:18,864 INFO L472 AbstractCegarLoop]: Abstraction has 524 states and 869 transitions. [2018-07-25 08:37:18,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 869 transitions. [2018-07-25 08:37:18,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:18,864 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:18,864 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:18,865 INFO L415 AbstractCegarLoop]: === Iteration 103 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:18,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1140912769, now seen corresponding path program 1 times [2018-07-25 08:37:18,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:18,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:18,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:18,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:18,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:18,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:18,877 INFO L87 Difference]: Start difference. First operand 524 states and 869 transitions. Second operand 10 states. [2018-07-25 08:37:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:19,398 INFO L93 Difference]: Finished difference Result 591 states and 958 transitions. [2018-07-25 08:37:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:19,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:19,399 INFO L225 Difference]: With dead ends: 591 [2018-07-25 08:37:19,399 INFO L226 Difference]: Without dead ends: 589 [2018-07-25 08:37:19,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:37:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-07-25 08:37:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 502. [2018-07-25 08:37:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-07-25 08:37:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 831 transitions. [2018-07-25 08:37:19,751 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 831 transitions. Word has length 18 [2018-07-25 08:37:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:19,751 INFO L472 AbstractCegarLoop]: Abstraction has 502 states and 831 transitions. [2018-07-25 08:37:19,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 831 transitions. [2018-07-25 08:37:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:37:19,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:19,751 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:19,752 INFO L415 AbstractCegarLoop]: === Iteration 104 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1070077282, now seen corresponding path program 1 times [2018-07-25 08:37:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:19,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:19,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:37:19,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:37:19,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:37:19,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:37:19,761 INFO L87 Difference]: Start difference. First operand 502 states and 831 transitions. Second operand 10 states. [2018-07-25 08:37:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:20,302 INFO L93 Difference]: Finished difference Result 576 states and 935 transitions. [2018-07-25 08:37:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:37:20,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:37:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:20,303 INFO L225 Difference]: With dead ends: 576 [2018-07-25 08:37:20,303 INFO L226 Difference]: Without dead ends: 574 [2018-07-25 08:37:20,304 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:37:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-07-25 08:37:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 490. [2018-07-25 08:37:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-07-25 08:37:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 811 transitions. [2018-07-25 08:37:20,679 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 811 transitions. Word has length 18 [2018-07-25 08:37:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:20,679 INFO L472 AbstractCegarLoop]: Abstraction has 490 states and 811 transitions. [2018-07-25 08:37:20,679 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:37:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 811 transitions. [2018-07-25 08:37:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:20,680 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:20,680 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:20,680 INFO L415 AbstractCegarLoop]: === Iteration 105 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash -850531879, now seen corresponding path program 3 times [2018-07-25 08:37:20,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:20,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:20,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:37:20,701 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:37:20,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:37:20,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:20,702 INFO L87 Difference]: Start difference. First operand 490 states and 811 transitions. Second operand 14 states. [2018-07-25 08:37:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:21,199 INFO L93 Difference]: Finished difference Result 502 states and 819 transitions. [2018-07-25 08:37:21,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:21,199 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:37:21,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:21,200 INFO L225 Difference]: With dead ends: 502 [2018-07-25 08:37:21,200 INFO L226 Difference]: Without dead ends: 501 [2018-07-25 08:37:21,200 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-25 08:37:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 454. [2018-07-25 08:37:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-07-25 08:37:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 750 transitions. [2018-07-25 08:37:21,595 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 750 transitions. Word has length 20 [2018-07-25 08:37:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:21,595 INFO L472 AbstractCegarLoop]: Abstraction has 454 states and 750 transitions. [2018-07-25 08:37:21,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:37:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 750 transitions. [2018-07-25 08:37:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:21,595 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:21,596 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:21,596 INFO L415 AbstractCegarLoop]: === Iteration 106 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1707385863, now seen corresponding path program 1 times [2018-07-25 08:37:21,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:21,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:21,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:37:21,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:37:21,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:37:21,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:21,612 INFO L87 Difference]: Start difference. First operand 454 states and 750 transitions. Second operand 14 states. [2018-07-25 08:37:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:22,159 INFO L93 Difference]: Finished difference Result 549 states and 901 transitions. [2018-07-25 08:37:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:22,159 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:37:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:22,160 INFO L225 Difference]: With dead ends: 549 [2018-07-25 08:37:22,160 INFO L226 Difference]: Without dead ends: 548 [2018-07-25 08:37:22,161 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-07-25 08:37:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2018-07-25 08:37:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-07-25 08:37:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 769 transitions. [2018-07-25 08:37:22,536 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 769 transitions. Word has length 20 [2018-07-25 08:37:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:22,536 INFO L472 AbstractCegarLoop]: Abstraction has 465 states and 769 transitions. [2018-07-25 08:37:22,536 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:37:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 769 transitions. [2018-07-25 08:37:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:22,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:22,536 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:22,537 INFO L415 AbstractCegarLoop]: === Iteration 107 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:22,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1999268581, now seen corresponding path program 2 times [2018-07-25 08:37:22,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:22,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:22,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:37:22,554 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:37:22,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:37:22,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:22,555 INFO L87 Difference]: Start difference. First operand 465 states and 769 transitions. Second operand 14 states. [2018-07-25 08:37:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:23,059 INFO L93 Difference]: Finished difference Result 510 states and 832 transitions. [2018-07-25 08:37:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:37:23,059 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:37:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:23,060 INFO L225 Difference]: With dead ends: 510 [2018-07-25 08:37:23,060 INFO L226 Difference]: Without dead ends: 508 [2018-07-25 08:37:23,060 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:37:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-07-25 08:37:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 449. [2018-07-25 08:37:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-07-25 08:37:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 743 transitions. [2018-07-25 08:37:23,428 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 743 transitions. Word has length 20 [2018-07-25 08:37:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:23,429 INFO L472 AbstractCegarLoop]: Abstraction has 449 states and 743 transitions. [2018-07-25 08:37:23,429 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:37:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 743 transitions. [2018-07-25 08:37:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:23,429 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:23,429 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:23,430 INFO L415 AbstractCegarLoop]: === Iteration 108 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1514664426, now seen corresponding path program 1 times [2018-07-25 08:37:23,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:23,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:23,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:23,449 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:23,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:23,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:23,449 INFO L87 Difference]: Start difference. First operand 449 states and 743 transitions. Second operand 13 states. [2018-07-25 08:37:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:24,111 INFO L93 Difference]: Finished difference Result 529 states and 854 transitions. [2018-07-25 08:37:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:37:24,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:24,112 INFO L225 Difference]: With dead ends: 529 [2018-07-25 08:37:24,112 INFO L226 Difference]: Without dead ends: 528 [2018-07-25 08:37:24,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:37:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-07-25 08:37:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 445. [2018-07-25 08:37:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-07-25 08:37:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 737 transitions. [2018-07-25 08:37:24,485 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 737 transitions. Word has length 20 [2018-07-25 08:37:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:24,485 INFO L472 AbstractCegarLoop]: Abstraction has 445 states and 737 transitions. [2018-07-25 08:37:24,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 737 transitions. [2018-07-25 08:37:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:24,486 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:24,486 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:24,486 INFO L415 AbstractCegarLoop]: === Iteration 109 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:24,486 INFO L82 PathProgramCache]: Analyzing trace with hash -390222799, now seen corresponding path program 4 times [2018-07-25 08:37:24,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:24,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:24,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:37:24,504 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:37:24,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:37:24,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:37:24,505 INFO L87 Difference]: Start difference. First operand 445 states and 737 transitions. Second operand 15 states. [2018-07-25 08:37:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:25,117 INFO L93 Difference]: Finished difference Result 502 states and 814 transitions. [2018-07-25 08:37:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:37:25,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-25 08:37:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:25,118 INFO L225 Difference]: With dead ends: 502 [2018-07-25 08:37:25,118 INFO L226 Difference]: Without dead ends: 501 [2018-07-25 08:37:25,118 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:37:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-07-25 08:37:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 459. [2018-07-25 08:37:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-07-25 08:37:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 759 transitions. [2018-07-25 08:37:25,498 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 759 transitions. Word has length 20 [2018-07-25 08:37:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:25,498 INFO L472 AbstractCegarLoop]: Abstraction has 459 states and 759 transitions. [2018-07-25 08:37:25,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:37:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 759 transitions. [2018-07-25 08:37:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:25,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:25,499 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:25,499 INFO L415 AbstractCegarLoop]: === Iteration 110 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2059824409, now seen corresponding path program 2 times [2018-07-25 08:37:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:25,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:25,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:37:25,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:37:25,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:37:25,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:25,520 INFO L87 Difference]: Start difference. First operand 459 states and 759 transitions. Second operand 14 states. [2018-07-25 08:37:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:26,084 INFO L93 Difference]: Finished difference Result 521 states and 849 transitions. [2018-07-25 08:37:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:37:26,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:37:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:26,085 INFO L225 Difference]: With dead ends: 521 [2018-07-25 08:37:26,085 INFO L226 Difference]: Without dead ends: 520 [2018-07-25 08:37:26,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:37:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-07-25 08:37:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 489. [2018-07-25 08:37:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-07-25 08:37:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 808 transitions. [2018-07-25 08:37:26,486 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 808 transitions. Word has length 20 [2018-07-25 08:37:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:26,486 INFO L472 AbstractCegarLoop]: Abstraction has 489 states and 808 transitions. [2018-07-25 08:37:26,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:37:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 808 transitions. [2018-07-25 08:37:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:26,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:26,487 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:26,487 INFO L415 AbstractCegarLoop]: === Iteration 111 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -781467557, now seen corresponding path program 1 times [2018-07-25 08:37:26,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:26,507 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:26,507 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:37:26,508 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:37:26,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:37:26,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:26,508 INFO L87 Difference]: Start difference. First operand 489 states and 808 transitions. Second operand 14 states. [2018-07-25 08:37:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:27,255 INFO L93 Difference]: Finished difference Result 578 states and 932 transitions. [2018-07-25 08:37:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:37:27,255 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:37:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:27,256 INFO L225 Difference]: With dead ends: 578 [2018-07-25 08:37:27,256 INFO L226 Difference]: Without dead ends: 576 [2018-07-25 08:37:27,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:37:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-07-25 08:37:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 493. [2018-07-25 08:37:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-07-25 08:37:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 815 transitions. [2018-07-25 08:37:27,671 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 815 transitions. Word has length 20 [2018-07-25 08:37:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:27,672 INFO L472 AbstractCegarLoop]: Abstraction has 493 states and 815 transitions. [2018-07-25 08:37:27,672 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:37:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 815 transitions. [2018-07-25 08:37:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:27,672 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:27,673 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:27,673 INFO L415 AbstractCegarLoop]: === Iteration 112 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -874261799, now seen corresponding path program 5 times [2018-07-25 08:37:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:27,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:27,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:37:27,690 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:37:27,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:37:27,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:37:27,690 INFO L87 Difference]: Start difference. First operand 493 states and 815 transitions. Second operand 15 states. [2018-07-25 08:37:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:28,466 INFO L93 Difference]: Finished difference Result 600 states and 981 transitions. [2018-07-25 08:37:28,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:37:28,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-07-25 08:37:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:28,467 INFO L225 Difference]: With dead ends: 600 [2018-07-25 08:37:28,467 INFO L226 Difference]: Without dead ends: 599 [2018-07-25 08:37:28,467 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:37:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-07-25 08:37:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-07-25 08:37:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-07-25 08:37:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 825 transitions. [2018-07-25 08:37:28,885 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 825 transitions. Word has length 20 [2018-07-25 08:37:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:28,885 INFO L472 AbstractCegarLoop]: Abstraction has 498 states and 825 transitions. [2018-07-25 08:37:28,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:37:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 825 transitions. [2018-07-25 08:37:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:28,885 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:28,885 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:28,886 INFO L415 AbstractCegarLoop]: === Iteration 113 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash -872968933, now seen corresponding path program 2 times [2018-07-25 08:37:28,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:28,901 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:28,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:37:28,902 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:37:28,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:37:28,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:28,902 INFO L87 Difference]: Start difference. First operand 498 states and 825 transitions. Second operand 14 states. [2018-07-25 08:37:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:29,859 INFO L93 Difference]: Finished difference Result 829 states and 1342 transitions. [2018-07-25 08:37:29,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:37:29,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:37:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:29,860 INFO L225 Difference]: With dead ends: 829 [2018-07-25 08:37:29,860 INFO L226 Difference]: Without dead ends: 827 [2018-07-25 08:37:29,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:37:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-07-25 08:37:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 612. [2018-07-25 08:37:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-07-25 08:37:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1017 transitions. [2018-07-25 08:37:30,352 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1017 transitions. Word has length 20 [2018-07-25 08:37:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:30,352 INFO L472 AbstractCegarLoop]: Abstraction has 612 states and 1017 transitions. [2018-07-25 08:37:30,352 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:37:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1017 transitions. [2018-07-25 08:37:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:30,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:30,353 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:30,353 INFO L415 AbstractCegarLoop]: === Iteration 114 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1388091879, now seen corresponding path program 1 times [2018-07-25 08:37:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:30,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:30,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:30,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:30,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:30,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:30,375 INFO L87 Difference]: Start difference. First operand 612 states and 1017 transitions. Second operand 13 states. [2018-07-25 08:37:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:31,093 INFO L93 Difference]: Finished difference Result 696 states and 1138 transitions. [2018-07-25 08:37:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:37:31,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:31,094 INFO L225 Difference]: With dead ends: 696 [2018-07-25 08:37:31,095 INFO L226 Difference]: Without dead ends: 694 [2018-07-25 08:37:31,095 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:37:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-07-25 08:37:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 643. [2018-07-25 08:37:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-07-25 08:37:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1068 transitions. [2018-07-25 08:37:31,582 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1068 transitions. Word has length 20 [2018-07-25 08:37:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:31,582 INFO L472 AbstractCegarLoop]: Abstraction has 643 states and 1068 transitions. [2018-07-25 08:37:31,582 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1068 transitions. [2018-07-25 08:37:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:31,583 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:31,583 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:31,583 INFO L415 AbstractCegarLoop]: === Iteration 115 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 149319872, now seen corresponding path program 3 times [2018-07-25 08:37:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:31,589 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:31,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:31,590 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:31,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:31,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:31,590 INFO L87 Difference]: Start difference. First operand 643 states and 1068 transitions. Second operand 7 states. [2018-07-25 08:37:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:32,687 INFO L93 Difference]: Finished difference Result 2025 states and 3340 transitions. [2018-07-25 08:37:32,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:37:32,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-25 08:37:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:32,689 INFO L225 Difference]: With dead ends: 2025 [2018-07-25 08:37:32,689 INFO L226 Difference]: Without dead ends: 1397 [2018-07-25 08:37:32,690 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:37:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2018-07-25 08:37:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1239. [2018-07-25 08:37:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-07-25 08:37:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2029 transitions. [2018-07-25 08:37:33,649 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2029 transitions. Word has length 20 [2018-07-25 08:37:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:33,649 INFO L472 AbstractCegarLoop]: Abstraction has 1239 states and 2029 transitions. [2018-07-25 08:37:33,650 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2029 transitions. [2018-07-25 08:37:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:33,651 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:33,651 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:33,651 INFO L415 AbstractCegarLoop]: === Iteration 116 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097883, now seen corresponding path program 1 times [2018-07-25 08:37:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:33,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:33,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:33,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:33,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:33,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:33,674 INFO L87 Difference]: Start difference. First operand 1239 states and 2029 transitions. Second operand 13 states. [2018-07-25 08:37:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:34,913 INFO L93 Difference]: Finished difference Result 1356 states and 2197 transitions. [2018-07-25 08:37:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:37:34,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:34,915 INFO L225 Difference]: With dead ends: 1356 [2018-07-25 08:37:34,915 INFO L226 Difference]: Without dead ends: 1354 [2018-07-25 08:37:34,916 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:37:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-07-25 08:37:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1251. [2018-07-25 08:37:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2018-07-25 08:37:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2049 transitions. [2018-07-25 08:37:35,953 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2049 transitions. Word has length 20 [2018-07-25 08:37:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:35,953 INFO L472 AbstractCegarLoop]: Abstraction has 1251 states and 2049 transitions. [2018-07-25 08:37:35,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2049 transitions. [2018-07-25 08:37:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:35,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:35,954 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:35,955 INFO L415 AbstractCegarLoop]: === Iteration 117 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1503357634, now seen corresponding path program 2 times [2018-07-25 08:37:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:35,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:35,977 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:35,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:35,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:35,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:35,978 INFO L87 Difference]: Start difference. First operand 1251 states and 2049 transitions. Second operand 13 states. [2018-07-25 08:37:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:37,304 INFO L93 Difference]: Finished difference Result 1410 states and 2292 transitions. [2018-07-25 08:37:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:37:37,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:37,307 INFO L225 Difference]: With dead ends: 1410 [2018-07-25 08:37:37,307 INFO L226 Difference]: Without dead ends: 1408 [2018-07-25 08:37:37,307 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:37:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-07-25 08:37:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1272. [2018-07-25 08:37:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-07-25 08:37:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2080 transitions. [2018-07-25 08:37:38,382 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2080 transitions. Word has length 20 [2018-07-25 08:37:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:38,382 INFO L472 AbstractCegarLoop]: Abstraction has 1272 states and 2080 transitions. [2018-07-25 08:37:38,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2080 transitions. [2018-07-25 08:37:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:38,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:38,383 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:38,384 INFO L415 AbstractCegarLoop]: === Iteration 118 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash 418443550, now seen corresponding path program 1 times [2018-07-25 08:37:38,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:38,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:38,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:38,397 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:38,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:38,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:38,397 INFO L87 Difference]: Start difference. First operand 1272 states and 2080 transitions. Second operand 13 states. [2018-07-25 08:37:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:39,652 INFO L93 Difference]: Finished difference Result 1365 states and 2218 transitions. [2018-07-25 08:37:39,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:37:39,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:39,654 INFO L225 Difference]: With dead ends: 1365 [2018-07-25 08:37:39,654 INFO L226 Difference]: Without dead ends: 1364 [2018-07-25 08:37:39,654 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:37:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2018-07-25 08:37:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1342. [2018-07-25 08:37:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-07-25 08:37:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2190 transitions. [2018-07-25 08:37:40,840 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2190 transitions. Word has length 20 [2018-07-25 08:37:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:40,840 INFO L472 AbstractCegarLoop]: Abstraction has 1342 states and 2190 transitions. [2018-07-25 08:37:40,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2190 transitions. [2018-07-25 08:37:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:40,842 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:40,842 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:40,842 INFO L415 AbstractCegarLoop]: === Iteration 119 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1962310520, now seen corresponding path program 4 times [2018-07-25 08:37:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:40,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:40,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:40,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:40,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:40,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:40,851 INFO L87 Difference]: Start difference. First operand 1342 states and 2190 transitions. Second operand 7 states. [2018-07-25 08:37:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:42,373 INFO L93 Difference]: Finished difference Result 2545 states and 4127 transitions. [2018-07-25 08:37:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:37:42,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-25 08:37:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:42,375 INFO L225 Difference]: With dead ends: 2545 [2018-07-25 08:37:42,375 INFO L226 Difference]: Without dead ends: 1760 [2018-07-25 08:37:42,376 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2018-07-25 08:37:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1331. [2018-07-25 08:37:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-07-25 08:37:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2166 transitions. [2018-07-25 08:37:43,482 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2166 transitions. Word has length 20 [2018-07-25 08:37:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:43,482 INFO L472 AbstractCegarLoop]: Abstraction has 1331 states and 2166 transitions. [2018-07-25 08:37:43,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2166 transitions. [2018-07-25 08:37:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:43,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:43,483 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:43,483 INFO L415 AbstractCegarLoop]: === Iteration 120 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:43,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1797340462, now seen corresponding path program 1 times [2018-07-25 08:37:43,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:43,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:43,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:43,495 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:43,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:43,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:43,496 INFO L87 Difference]: Start difference. First operand 1331 states and 2166 transitions. Second operand 12 states. [2018-07-25 08:37:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:45,032 INFO L93 Difference]: Finished difference Result 1610 states and 2608 transitions. [2018-07-25 08:37:45,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:37:45,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 08:37:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:45,033 INFO L225 Difference]: With dead ends: 1610 [2018-07-25 08:37:45,034 INFO L226 Difference]: Without dead ends: 1608 [2018-07-25 08:37:45,034 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:37:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-07-25 08:37:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1436. [2018-07-25 08:37:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2018-07-25 08:37:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2341 transitions. [2018-07-25 08:37:46,236 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2341 transitions. Word has length 20 [2018-07-25 08:37:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:46,236 INFO L472 AbstractCegarLoop]: Abstraction has 1436 states and 2341 transitions. [2018-07-25 08:37:46,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2341 transitions. [2018-07-25 08:37:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:46,237 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:46,237 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:46,238 INFO L415 AbstractCegarLoop]: === Iteration 121 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -70738496, now seen corresponding path program 5 times [2018-07-25 08:37:46,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:37:46,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:46,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:37:46,246 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:37:46,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:37:46,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:37:46,247 INFO L87 Difference]: Start difference. First operand 1436 states and 2341 transitions. Second operand 7 states. [2018-07-25 08:37:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:47,855 INFO L93 Difference]: Finished difference Result 2745 states and 4471 transitions. [2018-07-25 08:37:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:37:47,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-25 08:37:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:47,856 INFO L225 Difference]: With dead ends: 2745 [2018-07-25 08:37:47,857 INFO L226 Difference]: Without dead ends: 1823 [2018-07-25 08:37:47,858 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:37:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2018-07-25 08:37:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1657. [2018-07-25 08:37:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2018-07-25 08:37:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2701 transitions. [2018-07-25 08:37:49,202 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2701 transitions. Word has length 20 [2018-07-25 08:37:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:49,202 INFO L472 AbstractCegarLoop]: Abstraction has 1657 states and 2701 transitions. [2018-07-25 08:37:49,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:37:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2701 transitions. [2018-07-25 08:37:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:49,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:49,203 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:49,203 INFO L415 AbstractCegarLoop]: === Iteration 122 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash -70737726, now seen corresponding path program 2 times [2018-07-25 08:37:49,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:49,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:49,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:37:49,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:49,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:49,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:49,216 INFO L87 Difference]: Start difference. First operand 1657 states and 2701 transitions. Second operand 12 states. [2018-07-25 08:37:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:50,905 INFO L93 Difference]: Finished difference Result 1815 states and 2934 transitions. [2018-07-25 08:37:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:50,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 08:37:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:50,907 INFO L225 Difference]: With dead ends: 1815 [2018-07-25 08:37:50,907 INFO L226 Difference]: Without dead ends: 1813 [2018-07-25 08:37:50,907 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:37:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-07-25 08:37:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1651. [2018-07-25 08:37:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-25 08:37:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2690 transitions. [2018-07-25 08:37:52,288 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2690 transitions. Word has length 20 [2018-07-25 08:37:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:52,288 INFO L472 AbstractCegarLoop]: Abstraction has 1651 states and 2690 transitions. [2018-07-25 08:37:52,288 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:37:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2690 transitions. [2018-07-25 08:37:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:52,289 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:52,289 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:52,289 INFO L415 AbstractCegarLoop]: === Iteration 123 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash 56099968, now seen corresponding path program 1 times [2018-07-25 08:37:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:52,311 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:52,311 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:52,311 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:52,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:52,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:52,312 INFO L87 Difference]: Start difference. First operand 1651 states and 2690 transitions. Second operand 13 states. [2018-07-25 08:37:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:53,990 INFO L93 Difference]: Finished difference Result 1804 states and 2922 transitions. [2018-07-25 08:37:53,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:37:53,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:53,992 INFO L225 Difference]: With dead ends: 1804 [2018-07-25 08:37:53,992 INFO L226 Difference]: Without dead ends: 1802 [2018-07-25 08:37:53,993 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:37:53,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-07-25 08:37:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1635. [2018-07-25 08:37:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-07-25 08:37:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2664 transitions. [2018-07-25 08:37:55,343 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2664 transitions. Word has length 20 [2018-07-25 08:37:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:55,344 INFO L472 AbstractCegarLoop]: Abstraction has 1635 states and 2664 transitions. [2018-07-25 08:37:55,344 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2664 transitions. [2018-07-25 08:37:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:55,345 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:55,345 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:55,345 INFO L415 AbstractCegarLoop]: === Iteration 124 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1028814116, now seen corresponding path program 1 times [2018-07-25 08:37:55,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:55,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:55,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:37:55,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:37:55,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:37:55,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:37:55,363 INFO L87 Difference]: Start difference. First operand 1635 states and 2664 transitions. Second operand 13 states. [2018-07-25 08:37:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:37:57,268 INFO L93 Difference]: Finished difference Result 1702 states and 2762 transitions. [2018-07-25 08:37:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:37:57,268 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-07-25 08:37:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:37:57,270 INFO L225 Difference]: With dead ends: 1702 [2018-07-25 08:37:57,270 INFO L226 Difference]: Without dead ends: 1701 [2018-07-25 08:37:57,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:37:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2018-07-25 08:37:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1631. [2018-07-25 08:37:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-07-25 08:37:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2657 transitions. [2018-07-25 08:37:58,611 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2657 transitions. Word has length 20 [2018-07-25 08:37:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:37:58,611 INFO L472 AbstractCegarLoop]: Abstraction has 1631 states and 2657 transitions. [2018-07-25 08:37:58,611 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:37:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2657 transitions. [2018-07-25 08:37:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:37:58,612 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:37:58,612 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:37:58,612 INFO L415 AbstractCegarLoop]: === Iteration 125 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:37:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 294164016, now seen corresponding path program 1 times [2018-07-25 08:37:58,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:37:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:37:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:37:58,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:37:58,627 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:37:58,627 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:37:58,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:37:58,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:37:58,627 INFO L87 Difference]: Start difference. First operand 1631 states and 2657 transitions. Second operand 12 states. [2018-07-25 08:38:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:00,476 INFO L93 Difference]: Finished difference Result 1884 states and 3067 transitions. [2018-07-25 08:38:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:38:00,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 08:38:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:00,479 INFO L225 Difference]: With dead ends: 1884 [2018-07-25 08:38:00,479 INFO L226 Difference]: Without dead ends: 1883 [2018-07-25 08:38:00,479 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:38:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2018-07-25 08:38:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1605. [2018-07-25 08:38:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-07-25 08:38:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2615 transitions. [2018-07-25 08:38:01,866 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2615 transitions. Word has length 20 [2018-07-25 08:38:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:01,866 INFO L472 AbstractCegarLoop]: Abstraction has 1605 states and 2615 transitions. [2018-07-25 08:38:01,866 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2615 transitions. [2018-07-25 08:38:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:38:01,867 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:01,867 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:01,868 INFO L415 AbstractCegarLoop]: === Iteration 126 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash -503083984, now seen corresponding path program 1 times [2018-07-25 08:38:01,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:01,883 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:01,883 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:38:01,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:38:01,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:38:01,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:38:01,884 INFO L87 Difference]: Start difference. First operand 1605 states and 2615 transitions. Second operand 14 states. [2018-07-25 08:38:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:03,609 INFO L93 Difference]: Finished difference Result 1872 states and 3057 transitions. [2018-07-25 08:38:03,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:38:03,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-07-25 08:38:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:03,612 INFO L225 Difference]: With dead ends: 1872 [2018-07-25 08:38:03,612 INFO L226 Difference]: Without dead ends: 1871 [2018-07-25 08:38:03,612 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:38:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-25 08:38:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1694. [2018-07-25 08:38:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2018-07-25 08:38:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2762 transitions. [2018-07-25 08:38:05,050 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2762 transitions. Word has length 20 [2018-07-25 08:38:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:05,050 INFO L472 AbstractCegarLoop]: Abstraction has 1694 states and 2762 transitions. [2018-07-25 08:38:05,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:38:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2762 transitions. [2018-07-25 08:38:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:05,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:05,051 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:05,051 INFO L415 AbstractCegarLoop]: === Iteration 127 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1843127659, now seen corresponding path program 1 times [2018-07-25 08:38:05,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:05,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:05,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:05,067 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:05,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:05,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:05,068 INFO L87 Difference]: Start difference. First operand 1694 states and 2762 transitions. Second operand 12 states. [2018-07-25 08:38:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:06,748 INFO L93 Difference]: Finished difference Result 1818 states and 2952 transitions. [2018-07-25 08:38:06,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:38:06,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:38:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:06,751 INFO L225 Difference]: With dead ends: 1818 [2018-07-25 08:38:06,751 INFO L226 Difference]: Without dead ends: 1816 [2018-07-25 08:38:06,752 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:38:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-07-25 08:38:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1702. [2018-07-25 08:38:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-07-25 08:38:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2774 transitions. [2018-07-25 08:38:08,273 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2774 transitions. Word has length 21 [2018-07-25 08:38:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:08,273 INFO L472 AbstractCegarLoop]: Abstraction has 1702 states and 2774 transitions. [2018-07-25 08:38:08,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2774 transitions. [2018-07-25 08:38:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:08,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:08,274 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:08,275 INFO L415 AbstractCegarLoop]: === Iteration 128 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448723, now seen corresponding path program 1 times [2018-07-25 08:38:08,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:08,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:08,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:08,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:08,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:08,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:08,289 INFO L87 Difference]: Start difference. First operand 1702 states and 2774 transitions. Second operand 12 states. [2018-07-25 08:38:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:10,007 INFO L93 Difference]: Finished difference Result 1906 states and 3103 transitions. [2018-07-25 08:38:10,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:38:10,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:38:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:10,010 INFO L225 Difference]: With dead ends: 1906 [2018-07-25 08:38:10,010 INFO L226 Difference]: Without dead ends: 1904 [2018-07-25 08:38:10,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:38:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-07-25 08:38:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1715. [2018-07-25 08:38:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-07-25 08:38:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2795 transitions. [2018-07-25 08:38:11,486 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2795 transitions. Word has length 21 [2018-07-25 08:38:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:11,486 INFO L472 AbstractCegarLoop]: Abstraction has 1715 states and 2795 transitions. [2018-07-25 08:38:11,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2795 transitions. [2018-07-25 08:38:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:38:11,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:11,487 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:11,487 INFO L415 AbstractCegarLoop]: === Iteration 129 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:11,488 INFO L82 PathProgramCache]: Analyzing trace with hash -858694805, now seen corresponding path program 1 times [2018-07-25 08:38:11,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:11,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:11,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:38:11,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:38:11,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:38:11,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:38:11,499 INFO L87 Difference]: Start difference. First operand 1715 states and 2795 transitions. Second operand 12 states. [2018-07-25 08:38:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:13,392 INFO L93 Difference]: Finished difference Result 1953 states and 3181 transitions. [2018-07-25 08:38:13,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:38:13,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-07-25 08:38:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:13,394 INFO L225 Difference]: With dead ends: 1953 [2018-07-25 08:38:13,394 INFO L226 Difference]: Without dead ends: 1951 [2018-07-25 08:38:13,395 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:38:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-07-25 08:38:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1700. [2018-07-25 08:38:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-07-25 08:38:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2771 transitions. [2018-07-25 08:38:14,847 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2771 transitions. Word has length 21 [2018-07-25 08:38:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:14,848 INFO L472 AbstractCegarLoop]: Abstraction has 1700 states and 2771 transitions. [2018-07-25 08:38:14,848 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:38:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2771 transitions. [2018-07-25 08:38:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:14,849 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:14,849 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:38:14,849 INFO L415 AbstractCegarLoop]: === Iteration 130 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash -119563298, now seen corresponding path program 3 times [2018-07-25 08:38:14,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:14,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:14,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:38:14,874 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:38:14,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:38:14,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:38:14,874 INFO L87 Difference]: Start difference. First operand 1700 states and 2771 transitions. Second operand 16 states. [2018-07-25 08:38:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:16,496 INFO L93 Difference]: Finished difference Result 1765 states and 2860 transitions. [2018-07-25 08:38:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:38:16,496 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-25 08:38:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:16,498 INFO L225 Difference]: With dead ends: 1765 [2018-07-25 08:38:16,498 INFO L226 Difference]: Without dead ends: 1764 [2018-07-25 08:38:16,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:38:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-07-25 08:38:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1611. [2018-07-25 08:38:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2018-07-25 08:38:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2624 transitions. [2018-07-25 08:38:17,979 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2624 transitions. Word has length 22 [2018-07-25 08:38:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:17,980 INFO L472 AbstractCegarLoop]: Abstraction has 1611 states and 2624 transitions. [2018-07-25 08:38:17,980 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:38:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2624 transitions. [2018-07-25 08:38:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:17,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:17,981 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:38:17,981 INFO L415 AbstractCegarLoop]: === Iteration 131 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash 489410380, now seen corresponding path program 4 times [2018-07-25 08:38:17,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:18,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:18,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:38:18,002 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:38:18,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:38:18,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:38:18,002 INFO L87 Difference]: Start difference. First operand 1611 states and 2624 transitions. Second operand 16 states. [2018-07-25 08:38:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:19,740 INFO L93 Difference]: Finished difference Result 1706 states and 2757 transitions. [2018-07-25 08:38:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:38:19,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-25 08:38:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:19,742 INFO L225 Difference]: With dead ends: 1706 [2018-07-25 08:38:19,742 INFO L226 Difference]: Without dead ends: 1705 [2018-07-25 08:38:19,743 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:38:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-07-25 08:38:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1607. [2018-07-25 08:38:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2018-07-25 08:38:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2615 transitions. [2018-07-25 08:38:21,152 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2615 transitions. Word has length 22 [2018-07-25 08:38:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:21,152 INFO L472 AbstractCegarLoop]: Abstraction has 1607 states and 2615 transitions. [2018-07-25 08:38:21,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:38:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2615 transitions. [2018-07-25 08:38:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:21,153 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:21,153 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:21,154 INFO L415 AbstractCegarLoop]: === Iteration 132 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1161738932, now seen corresponding path program 2 times [2018-07-25 08:38:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:21,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:21,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:38:21,175 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:38:21,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:38:21,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:38:21,176 INFO L87 Difference]: Start difference. First operand 1607 states and 2615 transitions. Second operand 15 states. [2018-07-25 08:38:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:22,964 INFO L93 Difference]: Finished difference Result 1768 states and 2871 transitions. [2018-07-25 08:38:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:38:22,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 08:38:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:22,966 INFO L225 Difference]: With dead ends: 1768 [2018-07-25 08:38:22,966 INFO L226 Difference]: Without dead ends: 1767 [2018-07-25 08:38:22,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:38:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-07-25 08:38:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1649. [2018-07-25 08:38:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2018-07-25 08:38:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2685 transitions. [2018-07-25 08:38:24,413 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2685 transitions. Word has length 22 [2018-07-25 08:38:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:24,413 INFO L472 AbstractCegarLoop]: Abstraction has 1649 states and 2685 transitions. [2018-07-25 08:38:24,413 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:38:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2685 transitions. [2018-07-25 08:38:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:24,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:24,415 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:38:24,415 INFO L415 AbstractCegarLoop]: === Iteration 133 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1611878626, now seen corresponding path program 5 times [2018-07-25 08:38:24,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:24,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:24,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:38:24,435 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:38:24,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:38:24,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:38:24,436 INFO L87 Difference]: Start difference. First operand 1649 states and 2685 transitions. Second operand 16 states. [2018-07-25 08:38:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:26,736 INFO L93 Difference]: Finished difference Result 1995 states and 3219 transitions. [2018-07-25 08:38:26,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:38:26,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-07-25 08:38:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:26,738 INFO L225 Difference]: With dead ends: 1995 [2018-07-25 08:38:26,738 INFO L226 Difference]: Without dead ends: 1994 [2018-07-25 08:38:26,739 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:38:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-07-25 08:38:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1676. [2018-07-25 08:38:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2018-07-25 08:38:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2732 transitions. [2018-07-25 08:38:28,389 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2732 transitions. Word has length 22 [2018-07-25 08:38:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:28,389 INFO L472 AbstractCegarLoop]: Abstraction has 1676 states and 2732 transitions. [2018-07-25 08:38:28,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:38:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2732 transitions. [2018-07-25 08:38:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:28,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:28,390 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:28,390 INFO L415 AbstractCegarLoop]: === Iteration 134 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1825100773, now seen corresponding path program 1 times [2018-07-25 08:38:28,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:28,409 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:28,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:38:28,409 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:38:28,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:38:28,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:38:28,410 INFO L87 Difference]: Start difference. First operand 1676 states and 2732 transitions. Second operand 15 states. [2018-07-25 08:38:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:30,311 INFO L93 Difference]: Finished difference Result 1916 states and 3112 transitions. [2018-07-25 08:38:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:38:30,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 08:38:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:30,313 INFO L225 Difference]: With dead ends: 1916 [2018-07-25 08:38:30,314 INFO L226 Difference]: Without dead ends: 1914 [2018-07-25 08:38:30,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:38:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2018-07-25 08:38:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1767. [2018-07-25 08:38:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-07-25 08:38:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2876 transitions. [2018-07-25 08:38:31,932 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2876 transitions. Word has length 22 [2018-07-25 08:38:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:31,933 INFO L472 AbstractCegarLoop]: Abstraction has 1767 states and 2876 transitions. [2018-07-25 08:38:31,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:38:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2876 transitions. [2018-07-25 08:38:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:31,934 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:31,934 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:31,934 INFO L415 AbstractCegarLoop]: === Iteration 135 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:31,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1601377053, now seen corresponding path program 1 times [2018-07-25 08:38:31,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:31,949 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:31,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:38:31,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:38:31,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:38:31,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:38:31,950 INFO L87 Difference]: Start difference. First operand 1767 states and 2876 transitions. Second operand 14 states. [2018-07-25 08:38:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:33,694 INFO L93 Difference]: Finished difference Result 1874 states and 3046 transitions. [2018-07-25 08:38:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:38:33,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-25 08:38:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:33,696 INFO L225 Difference]: With dead ends: 1874 [2018-07-25 08:38:33,696 INFO L226 Difference]: Without dead ends: 1873 [2018-07-25 08:38:33,696 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:38:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-25 08:38:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1763. [2018-07-25 08:38:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-07-25 08:38:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2871 transitions. [2018-07-25 08:38:35,298 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2871 transitions. Word has length 22 [2018-07-25 08:38:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:35,298 INFO L472 AbstractCegarLoop]: Abstraction has 1763 states and 2871 transitions. [2018-07-25 08:38:35,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:38:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2871 transitions. [2018-07-25 08:38:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:35,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:35,300 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:35,301 INFO L415 AbstractCegarLoop]: === Iteration 136 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1715079645, now seen corresponding path program 1 times [2018-07-25 08:38:35,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:35,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:35,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:38:35,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:38:35,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:38:35,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:38:35,323 INFO L87 Difference]: Start difference. First operand 1763 states and 2871 transitions. Second operand 15 states. [2018-07-25 08:38:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:37,334 INFO L93 Difference]: Finished difference Result 1970 states and 3194 transitions. [2018-07-25 08:38:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:38:37,334 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 08:38:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:37,336 INFO L225 Difference]: With dead ends: 1970 [2018-07-25 08:38:37,336 INFO L226 Difference]: Without dead ends: 1968 [2018-07-25 08:38:37,337 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:38:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-07-25 08:38:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1712. [2018-07-25 08:38:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2018-07-25 08:38:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2788 transitions. [2018-07-25 08:38:38,953 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2788 transitions. Word has length 22 [2018-07-25 08:38:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:38,953 INFO L472 AbstractCegarLoop]: Abstraction has 1712 states and 2788 transitions. [2018-07-25 08:38:38,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:38:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2788 transitions. [2018-07-25 08:38:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:38,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:38,954 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:38:38,954 INFO L415 AbstractCegarLoop]: === Iteration 137 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -846590175, now seen corresponding path program 3 times [2018-07-25 08:38:38,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:38,971 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:38,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:38:38,972 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:38:38,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:38:38,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:38:38,972 INFO L87 Difference]: Start difference. First operand 1712 states and 2788 transitions. Second operand 14 states. [2018-07-25 08:38:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:40,772 INFO L93 Difference]: Finished difference Result 1872 states and 3041 transitions. [2018-07-25 08:38:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:38:40,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-07-25 08:38:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:40,774 INFO L225 Difference]: With dead ends: 1872 [2018-07-25 08:38:40,774 INFO L226 Difference]: Without dead ends: 1871 [2018-07-25 08:38:40,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:38:40,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-07-25 08:38:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1656. [2018-07-25 08:38:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-07-25 08:38:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2697 transitions. [2018-07-25 08:38:42,259 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2697 transitions. Word has length 22 [2018-07-25 08:38:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:42,259 INFO L472 AbstractCegarLoop]: Abstraction has 1656 states and 2697 transitions. [2018-07-25 08:38:42,259 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:38:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2697 transitions. [2018-07-25 08:38:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:38:42,260 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:42,260 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:42,260 INFO L415 AbstractCegarLoop]: === Iteration 138 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1868893045, now seen corresponding path program 2 times [2018-07-25 08:38:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:42,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:42,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:38:42,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:38:42,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:38:42,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:38:42,281 INFO L87 Difference]: Start difference. First operand 1656 states and 2697 transitions. Second operand 15 states. [2018-07-25 08:38:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:44,026 INFO L93 Difference]: Finished difference Result 1826 states and 2973 transitions. [2018-07-25 08:38:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:38:44,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-07-25 08:38:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:44,028 INFO L225 Difference]: With dead ends: 1826 [2018-07-25 08:38:44,028 INFO L226 Difference]: Without dead ends: 1825 [2018-07-25 08:38:44,028 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:38:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2018-07-25 08:38:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1527. [2018-07-25 08:38:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-07-25 08:38:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2487 transitions. [2018-07-25 08:38:45,441 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2487 transitions. Word has length 22 [2018-07-25 08:38:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:45,442 INFO L472 AbstractCegarLoop]: Abstraction has 1527 states and 2487 transitions. [2018-07-25 08:38:45,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:38:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2487 transitions. [2018-07-25 08:38:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:38:45,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:45,443 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:45,443 INFO L415 AbstractCegarLoop]: === Iteration 139 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash 441602332, now seen corresponding path program 1 times [2018-07-25 08:38:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:45,458 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:45,458 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:38:45,458 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:38:45,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:38:45,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:38:45,458 INFO L87 Difference]: Start difference. First operand 1527 states and 2487 transitions. Second operand 14 states. [2018-07-25 08:38:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:47,102 INFO L93 Difference]: Finished difference Result 1634 states and 2653 transitions. [2018-07-25 08:38:47,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:38:47,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:38:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:47,104 INFO L225 Difference]: With dead ends: 1634 [2018-07-25 08:38:47,104 INFO L226 Difference]: Without dead ends: 1633 [2018-07-25 08:38:47,104 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:38:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-07-25 08:38:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1575. [2018-07-25 08:38:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-25 08:38:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-25 08:38:48,549 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-25 08:38:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:48,549 INFO L472 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-25 08:38:48,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:38:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-25 08:38:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:38:48,550 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:48,551 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:48,551 INFO L415 AbstractCegarLoop]: === Iteration 140 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1719959184, now seen corresponding path program 1 times [2018-07-25 08:38:48,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:48,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:48,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:38:48,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:38:48,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:38:48,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:38:48,570 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-25 08:38:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:50,361 INFO L93 Difference]: Finished difference Result 1685 states and 2725 transitions. [2018-07-25 08:38:50,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:38:50,361 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:38:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:50,362 INFO L225 Difference]: With dead ends: 1685 [2018-07-25 08:38:50,363 INFO L226 Difference]: Without dead ends: 1683 [2018-07-25 08:38:50,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:38:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-07-25 08:38:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1575. [2018-07-25 08:38:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-07-25 08:38:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2566 transitions. [2018-07-25 08:38:51,798 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2566 transitions. Word has length 23 [2018-07-25 08:38:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:51,798 INFO L472 AbstractCegarLoop]: Abstraction has 1575 states and 2566 transitions. [2018-07-25 08:38:51,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:38:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2566 transitions. [2018-07-25 08:38:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:38:51,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:51,800 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:51,800 INFO L415 AbstractCegarLoop]: === Iteration 141 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:51,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1628457808, now seen corresponding path program 2 times [2018-07-25 08:38:51,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:51,812 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:51,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:38:51,813 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:38:51,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:38:51,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:38:51,813 INFO L87 Difference]: Start difference. First operand 1575 states and 2566 transitions. Second operand 14 states. [2018-07-25 08:38:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:53,891 INFO L93 Difference]: Finished difference Result 2088 states and 3396 transitions. [2018-07-25 08:38:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:38:53,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:38:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:53,893 INFO L225 Difference]: With dead ends: 2088 [2018-07-25 08:38:53,893 INFO L226 Difference]: Without dead ends: 2086 [2018-07-25 08:38:53,894 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:38:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-07-25 08:38:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1710. [2018-07-25 08:38:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-07-25 08:38:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2793 transitions. [2018-07-25 08:38:55,489 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2793 transitions. Word has length 23 [2018-07-25 08:38:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:55,489 INFO L472 AbstractCegarLoop]: Abstraction has 1710 states and 2793 transitions. [2018-07-25 08:38:55,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:38:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2793 transitions. [2018-07-25 08:38:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:38:55,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:55,490 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:55,490 INFO L415 AbstractCegarLoop]: === Iteration 142 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1349164405, now seen corresponding path program 3 times [2018-07-25 08:38:55,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:55,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:55,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:38:55,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:38:55,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:38:55,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:38:55,505 INFO L87 Difference]: Start difference. First operand 1710 states and 2793 transitions. Second operand 16 states. [2018-07-25 08:38:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:38:57,273 INFO L93 Difference]: Finished difference Result 1839 states and 2998 transitions. [2018-07-25 08:38:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:38:57,273 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-25 08:38:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:38:57,275 INFO L225 Difference]: With dead ends: 1839 [2018-07-25 08:38:57,275 INFO L226 Difference]: Without dead ends: 1838 [2018-07-25 08:38:57,275 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:38:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-07-25 08:38:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1750. [2018-07-25 08:38:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-25 08:38:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2860 transitions. [2018-07-25 08:38:58,968 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2860 transitions. Word has length 23 [2018-07-25 08:38:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:38:58,968 INFO L472 AbstractCegarLoop]: Abstraction has 1750 states and 2860 transitions. [2018-07-25 08:38:58,968 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:38:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2860 transitions. [2018-07-25 08:38:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:38:58,969 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:38:58,969 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:38:58,970 INFO L415 AbstractCegarLoop]: === Iteration 143 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:38:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1977166985, now seen corresponding path program 1 times [2018-07-25 08:38:58,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:38:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:38:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:38:58,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:38:58,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:38:58,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:38:58,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:38:58,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:38:58,993 INFO L87 Difference]: Start difference. First operand 1750 states and 2860 transitions. Second operand 15 states. [2018-07-25 08:39:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:01,125 INFO L93 Difference]: Finished difference Result 1875 states and 3050 transitions. [2018-07-25 08:39:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:39:01,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 08:39:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:01,128 INFO L225 Difference]: With dead ends: 1875 [2018-07-25 08:39:01,128 INFO L226 Difference]: Without dead ends: 1873 [2018-07-25 08:39:01,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:39:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-07-25 08:39:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1738. [2018-07-25 08:39:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2018-07-25 08:39:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2840 transitions. [2018-07-25 08:39:02,831 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2840 transitions. Word has length 23 [2018-07-25 08:39:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:02,832 INFO L472 AbstractCegarLoop]: Abstraction has 1738 states and 2840 transitions. [2018-07-25 08:39:02,832 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:39:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2840 transitions. [2018-07-25 08:39:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:02,833 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:02,833 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:02,833 INFO L415 AbstractCegarLoop]: === Iteration 144 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash -451471923, now seen corresponding path program 4 times [2018-07-25 08:39:02,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:02,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:02,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:39:02,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:39:02,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:39:02,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:39:02,851 INFO L87 Difference]: Start difference. First operand 1738 states and 2840 transitions. Second operand 16 states. [2018-07-25 08:39:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:04,873 INFO L93 Difference]: Finished difference Result 1956 states and 3208 transitions. [2018-07-25 08:39:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:39:04,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-25 08:39:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:04,875 INFO L225 Difference]: With dead ends: 1956 [2018-07-25 08:39:04,875 INFO L226 Difference]: Without dead ends: 1955 [2018-07-25 08:39:04,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:39:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-25 08:39:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1711. [2018-07-25 08:39:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2018-07-25 08:39:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2797 transitions. [2018-07-25 08:39:06,415 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2797 transitions. Word has length 23 [2018-07-25 08:39:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:06,415 INFO L472 AbstractCegarLoop]: Abstraction has 1711 states and 2797 transitions. [2018-07-25 08:39:06,415 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:39:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2797 transitions. [2018-07-25 08:39:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:06,416 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:06,416 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:06,417 INFO L415 AbstractCegarLoop]: === Iteration 145 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -451472211, now seen corresponding path program 2 times [2018-07-25 08:39:06,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:06,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:06,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:39:06,430 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:39:06,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:39:06,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:39:06,431 INFO L87 Difference]: Start difference. First operand 1711 states and 2797 transitions. Second operand 14 states. [2018-07-25 08:39:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:08,369 INFO L93 Difference]: Finished difference Result 1914 states and 3100 transitions. [2018-07-25 08:39:08,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:39:08,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:39:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:08,371 INFO L225 Difference]: With dead ends: 1914 [2018-07-25 08:39:08,371 INFO L226 Difference]: Without dead ends: 1912 [2018-07-25 08:39:08,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:39:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-07-25 08:39:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1723. [2018-07-25 08:39:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-07-25 08:39:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2809 transitions. [2018-07-25 08:39:09,971 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2809 transitions. Word has length 23 [2018-07-25 08:39:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:09,971 INFO L472 AbstractCegarLoop]: Abstraction has 1723 states and 2809 transitions. [2018-07-25 08:39:09,971 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:39:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2809 transitions. [2018-07-25 08:39:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:09,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:09,972 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:09,972 INFO L415 AbstractCegarLoop]: === Iteration 146 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash -590426441, now seen corresponding path program 2 times [2018-07-25 08:39:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:09,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:09,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:39:09,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:39:09,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:39:09,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:39:09,989 INFO L87 Difference]: Start difference. First operand 1723 states and 2809 transitions. Second operand 15 states. [2018-07-25 08:39:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:12,078 INFO L93 Difference]: Finished difference Result 1923 states and 3105 transitions. [2018-07-25 08:39:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:39:12,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 08:39:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:12,080 INFO L225 Difference]: With dead ends: 1923 [2018-07-25 08:39:12,080 INFO L226 Difference]: Without dead ends: 1921 [2018-07-25 08:39:12,081 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:39:12,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-07-25 08:39:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1745. [2018-07-25 08:39:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2018-07-25 08:39:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2845 transitions. [2018-07-25 08:39:13,689 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2845 transitions. Word has length 23 [2018-07-25 08:39:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:13,689 INFO L472 AbstractCegarLoop]: Abstraction has 1745 states and 2845 transitions. [2018-07-25 08:39:13,689 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:39:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2845 transitions. [2018-07-25 08:39:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:13,690 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:13,691 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:13,691 INFO L415 AbstractCegarLoop]: === Iteration 147 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1677111747, now seen corresponding path program 3 times [2018-07-25 08:39:13,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:13,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:13,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:39:13,703 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:39:13,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:39:13,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:39:13,704 INFO L87 Difference]: Start difference. First operand 1745 states and 2845 transitions. Second operand 14 states. [2018-07-25 08:39:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:15,957 INFO L93 Difference]: Finished difference Result 2195 states and 3566 transitions. [2018-07-25 08:39:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:39:15,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:39:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:15,960 INFO L225 Difference]: With dead ends: 2195 [2018-07-25 08:39:15,960 INFO L226 Difference]: Without dead ends: 2193 [2018-07-25 08:39:15,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:39:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-07-25 08:39:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1652. [2018-07-25 08:39:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-07-25 08:39:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2691 transitions. [2018-07-25 08:39:17,602 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2691 transitions. Word has length 23 [2018-07-25 08:39:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:17,602 INFO L472 AbstractCegarLoop]: Abstraction has 1652 states and 2691 transitions. [2018-07-25 08:39:17,602 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:39:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2691 transitions. [2018-07-25 08:39:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:17,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:17,603 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:17,603 INFO L415 AbstractCegarLoop]: === Iteration 148 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash 170792271, now seen corresponding path program 2 times [2018-07-25 08:39:17,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:17,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:17,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:39:17,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:39:17,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:39:17,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:39:17,620 INFO L87 Difference]: Start difference. First operand 1652 states and 2691 transitions. Second operand 16 states. [2018-07-25 08:39:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:19,680 INFO L93 Difference]: Finished difference Result 1928 states and 3135 transitions. [2018-07-25 08:39:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:39:19,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-07-25 08:39:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:19,683 INFO L225 Difference]: With dead ends: 1928 [2018-07-25 08:39:19,683 INFO L226 Difference]: Without dead ends: 1927 [2018-07-25 08:39:19,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:39:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2018-07-25 08:39:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1651. [2018-07-25 08:39:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2018-07-25 08:39:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2684 transitions. [2018-07-25 08:39:21,314 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2684 transitions. Word has length 23 [2018-07-25 08:39:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:21,314 INFO L472 AbstractCegarLoop]: Abstraction has 1651 states and 2684 transitions. [2018-07-25 08:39:21,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:39:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2684 transitions. [2018-07-25 08:39:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:21,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:21,315 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:21,315 INFO L415 AbstractCegarLoop]: === Iteration 149 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 170791983, now seen corresponding path program 4 times [2018-07-25 08:39:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:21,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:21,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:39:21,329 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:39:21,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:39:21,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:39:21,329 INFO L87 Difference]: Start difference. First operand 1651 states and 2684 transitions. Second operand 14 states. [2018-07-25 08:39:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:23,432 INFO L93 Difference]: Finished difference Result 1899 states and 3045 transitions. [2018-07-25 08:39:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:39:23,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:39:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:23,434 INFO L225 Difference]: With dead ends: 1899 [2018-07-25 08:39:23,434 INFO L226 Difference]: Without dead ends: 1897 [2018-07-25 08:39:23,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:39:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2018-07-25 08:39:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1441. [2018-07-25 08:39:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-25 08:39:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2333 transitions. [2018-07-25 08:39:25,021 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2333 transitions. Word has length 23 [2018-07-25 08:39:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:25,022 INFO L472 AbstractCegarLoop]: Abstraction has 1441 states and 2333 transitions. [2018-07-25 08:39:25,022 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:39:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2333 transitions. [2018-07-25 08:39:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:25,023 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:25,023 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:25,023 INFO L415 AbstractCegarLoop]: === Iteration 150 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash 162203814, now seen corresponding path program 2 times [2018-07-25 08:39:25,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-25 08:39:25,038 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:25,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:39:25,039 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:39:25,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:39:25,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:39:25,039 INFO L87 Difference]: Start difference. First operand 1441 states and 2333 transitions. Second operand 15 states. [2018-07-25 08:39:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:27,039 INFO L93 Difference]: Finished difference Result 1620 states and 2601 transitions. [2018-07-25 08:39:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:39:27,040 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 08:39:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:27,041 INFO L225 Difference]: With dead ends: 1620 [2018-07-25 08:39:27,041 INFO L226 Difference]: Without dead ends: 1619 [2018-07-25 08:39:27,042 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:39:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-07-25 08:39:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1439. [2018-07-25 08:39:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-07-25 08:39:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2328 transitions. [2018-07-25 08:39:28,685 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2328 transitions. Word has length 23 [2018-07-25 08:39:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:28,685 INFO L472 AbstractCegarLoop]: Abstraction has 1439 states and 2328 transitions. [2018-07-25 08:39:28,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:39:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2328 transitions. [2018-07-25 08:39:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:28,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:28,686 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:28,686 INFO L415 AbstractCegarLoop]: === Iteration 151 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:28,686 INFO L82 PathProgramCache]: Analyzing trace with hash 162205096, now seen corresponding path program 2 times [2018-07-25 08:39:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:28,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:28,710 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:39:28,710 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:39:28,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:39:28,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:39:28,711 INFO L87 Difference]: Start difference. First operand 1439 states and 2328 transitions. Second operand 14 states. [2018-07-25 08:39:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:30,791 INFO L93 Difference]: Finished difference Result 1661 states and 2663 transitions. [2018-07-25 08:39:30,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:39:30,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-07-25 08:39:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:30,793 INFO L225 Difference]: With dead ends: 1661 [2018-07-25 08:39:30,793 INFO L226 Difference]: Without dead ends: 1659 [2018-07-25 08:39:30,794 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:39:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-07-25 08:39:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1441. [2018-07-25 08:39:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2018-07-25 08:39:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2330 transitions. [2018-07-25 08:39:32,409 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2330 transitions. Word has length 23 [2018-07-25 08:39:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:32,409 INFO L472 AbstractCegarLoop]: Abstraction has 1441 states and 2330 transitions. [2018-07-25 08:39:32,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:39:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2330 transitions. [2018-07-25 08:39:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:32,410 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:32,410 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:32,410 INFO L415 AbstractCegarLoop]: === Iteration 152 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash 208964473, now seen corresponding path program 2 times [2018-07-25 08:39:32,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:32,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:32,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:39:32,431 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:39:32,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:39:32,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:39:32,432 INFO L87 Difference]: Start difference. First operand 1441 states and 2330 transitions. Second operand 15 states. [2018-07-25 08:39:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:35,091 INFO L93 Difference]: Finished difference Result 2002 states and 3222 transitions. [2018-07-25 08:39:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:39:35,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2018-07-25 08:39:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:35,093 INFO L225 Difference]: With dead ends: 2002 [2018-07-25 08:39:35,093 INFO L226 Difference]: Without dead ends: 2000 [2018-07-25 08:39:35,093 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:39:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2018-07-25 08:39:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1602. [2018-07-25 08:39:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-07-25 08:39:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2591 transitions. [2018-07-25 08:39:36,978 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2591 transitions. Word has length 23 [2018-07-25 08:39:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:36,978 INFO L472 AbstractCegarLoop]: Abstraction has 1602 states and 2591 transitions. [2018-07-25 08:39:36,978 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:39:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2591 transitions. [2018-07-25 08:39:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:39:36,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:36,979 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:36,979 INFO L415 AbstractCegarLoop]: === Iteration 153 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1117815128, now seen corresponding path program 1 times [2018-07-25 08:39:36,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:36,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:36,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:39:36,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:39:36,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:39:37,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:39:37,000 INFO L87 Difference]: Start difference. First operand 1602 states and 2591 transitions. Second operand 13 states. [2018-07-25 08:39:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:39,474 INFO L93 Difference]: Finished difference Result 1864 states and 2997 transitions. [2018-07-25 08:39:39,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:39:39,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-07-25 08:39:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:39,476 INFO L225 Difference]: With dead ends: 1864 [2018-07-25 08:39:39,476 INFO L226 Difference]: Without dead ends: 1862 [2018-07-25 08:39:39,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:39:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-25 08:39:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1671. [2018-07-25 08:39:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-25 08:39:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2717 transitions. [2018-07-25 08:39:41,564 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2717 transitions. Word has length 23 [2018-07-25 08:39:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:41,564 INFO L472 AbstractCegarLoop]: Abstraction has 1671 states and 2717 transitions. [2018-07-25 08:39:41,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:39:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2717 transitions. [2018-07-25 08:39:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:39:41,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:41,565 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:41,565 INFO L415 AbstractCegarLoop]: === Iteration 154 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -821177279, now seen corresponding path program 2 times [2018-07-25 08:39:41,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:41,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:41,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:39:41,586 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:39:41,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:39:41,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:39:41,586 INFO L87 Difference]: Start difference. First operand 1671 states and 2717 transitions. Second operand 16 states. [2018-07-25 08:39:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:43,909 INFO L93 Difference]: Finished difference Result 1740 states and 2811 transitions. [2018-07-25 08:39:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:39:43,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 08:39:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:43,912 INFO L225 Difference]: With dead ends: 1740 [2018-07-25 08:39:43,912 INFO L226 Difference]: Without dead ends: 1739 [2018-07-25 08:39:43,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:39:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2018-07-25 08:39:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1613. [2018-07-25 08:39:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2018-07-25 08:39:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2622 transitions. [2018-07-25 08:39:45,861 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2622 transitions. Word has length 25 [2018-07-25 08:39:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:45,861 INFO L472 AbstractCegarLoop]: Abstraction has 1613 states and 2622 transitions. [2018-07-25 08:39:45,861 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:39:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2622 transitions. [2018-07-25 08:39:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:39:45,862 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:45,862 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:45,862 INFO L415 AbstractCegarLoop]: === Iteration 155 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1822640705, now seen corresponding path program 1 times [2018-07-25 08:39:45,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:45,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:45,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:39:45,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:39:45,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:39:45,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:39:45,877 INFO L87 Difference]: Start difference. First operand 1613 states and 2622 transitions. Second operand 15 states. [2018-07-25 08:39:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:48,189 INFO L93 Difference]: Finished difference Result 1786 states and 2897 transitions. [2018-07-25 08:39:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:39:48,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-07-25 08:39:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:48,191 INFO L225 Difference]: With dead ends: 1786 [2018-07-25 08:39:48,192 INFO L226 Difference]: Without dead ends: 1785 [2018-07-25 08:39:48,192 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:39:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2018-07-25 08:39:50,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1655. [2018-07-25 08:39:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2018-07-25 08:39:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2692 transitions. [2018-07-25 08:39:50,167 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2692 transitions. Word has length 25 [2018-07-25 08:39:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:50,167 INFO L472 AbstractCegarLoop]: Abstraction has 1655 states and 2692 transitions. [2018-07-25 08:39:50,168 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:39:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2692 transitions. [2018-07-25 08:39:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:39:50,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:50,169 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:39:50,169 INFO L415 AbstractCegarLoop]: === Iteration 156 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1372501011, now seen corresponding path program 3 times [2018-07-25 08:39:50,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:50,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:50,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:39:50,184 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:39:50,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:39:50,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:39:50,184 INFO L87 Difference]: Start difference. First operand 1655 states and 2692 transitions. Second operand 16 states. [2018-07-25 08:39:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:52,953 INFO L93 Difference]: Finished difference Result 2034 states and 3278 transitions. [2018-07-25 08:39:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:39:52,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 08:39:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:52,955 INFO L225 Difference]: With dead ends: 2034 [2018-07-25 08:39:52,956 INFO L226 Difference]: Without dead ends: 2033 [2018-07-25 08:39:52,956 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=473, Invalid=3187, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:39:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2018-07-25 08:39:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1671. [2018-07-25 08:39:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-07-25 08:39:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2720 transitions. [2018-07-25 08:39:54,955 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2720 transitions. Word has length 25 [2018-07-25 08:39:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:54,955 INFO L472 AbstractCegarLoop]: Abstraction has 1671 states and 2720 transitions. [2018-07-25 08:39:54,955 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:39:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2720 transitions. [2018-07-25 08:39:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:39:54,956 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:54,956 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:54,957 INFO L415 AbstractCegarLoop]: === Iteration 157 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash -532386214, now seen corresponding path program 6 times [2018-07-25 08:39:54,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:54,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:54,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:39:54,985 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:39:54,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:39:54,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:39:54,986 INFO L87 Difference]: Start difference. First operand 1671 states and 2720 transitions. Second operand 18 states. [2018-07-25 08:39:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:39:57,177 INFO L93 Difference]: Finished difference Result 1747 states and 2831 transitions. [2018-07-25 08:39:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:39:57,177 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-25 08:39:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:39:57,179 INFO L225 Difference]: With dead ends: 1747 [2018-07-25 08:39:57,179 INFO L226 Difference]: Without dead ends: 1746 [2018-07-25 08:39:57,179 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:39:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-07-25 08:39:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1673. [2018-07-25 08:39:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-07-25 08:39:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2721 transitions. [2018-07-25 08:39:59,271 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2721 transitions. Word has length 25 [2018-07-25 08:39:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:39:59,271 INFO L472 AbstractCegarLoop]: Abstraction has 1673 states and 2721 transitions. [2018-07-25 08:39:59,271 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:39:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2721 transitions. [2018-07-25 08:39:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:39:59,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:39:59,272 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:39:59,272 INFO L415 AbstractCegarLoop]: === Iteration 158 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:39:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1681122916, now seen corresponding path program 2 times [2018-07-25 08:39:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:39:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:39:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:39:59,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:39:59,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:39:59,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:39:59,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:39:59,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:39:59,295 INFO L87 Difference]: Start difference. First operand 1673 states and 2721 transitions. Second operand 17 states. [2018-07-25 08:40:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:01,904 INFO L93 Difference]: Finished difference Result 1789 states and 2888 transitions. [2018-07-25 08:40:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:40:01,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-25 08:40:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:01,906 INFO L225 Difference]: With dead ends: 1789 [2018-07-25 08:40:01,906 INFO L226 Difference]: Without dead ends: 1787 [2018-07-25 08:40:01,907 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:40:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-07-25 08:40:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1641. [2018-07-25 08:40:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2018-07-25 08:40:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2669 transitions. [2018-07-25 08:40:04,095 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2669 transitions. Word has length 25 [2018-07-25 08:40:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:04,095 INFO L472 AbstractCegarLoop]: Abstraction has 1641 states and 2669 transitions. [2018-07-25 08:40:04,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:40:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2669 transitions. [2018-07-25 08:40:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:04,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:04,097 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:40:04,097 INFO L415 AbstractCegarLoop]: === Iteration 159 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1832810091, now seen corresponding path program 4 times [2018-07-25 08:40:04,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:04,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:04,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:40:04,114 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:40:04,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:40:04,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:40:04,114 INFO L87 Difference]: Start difference. First operand 1641 states and 2669 transitions. Second operand 16 states. [2018-07-25 08:40:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:07,046 INFO L93 Difference]: Finished difference Result 1864 states and 3013 transitions. [2018-07-25 08:40:07,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:40:07,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 08:40:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:07,048 INFO L225 Difference]: With dead ends: 1864 [2018-07-25 08:40:07,048 INFO L226 Difference]: Without dead ends: 1862 [2018-07-25 08:40:07,049 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:40:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2018-07-25 08:40:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1610. [2018-07-25 08:40:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-07-25 08:40:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2618 transitions. [2018-07-25 08:40:09,152 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2618 transitions. Word has length 25 [2018-07-25 08:40:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:09,153 INFO L472 AbstractCegarLoop]: Abstraction has 1610 states and 2618 transitions. [2018-07-25 08:40:09,153 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:40:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2618 transitions. [2018-07-25 08:40:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:09,154 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:09,154 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:09,154 INFO L415 AbstractCegarLoop]: === Iteration 160 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash -72077134, now seen corresponding path program 7 times [2018-07-25 08:40:09,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:09,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:09,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:40:09,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:40:09,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:40:09,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:40:09,185 INFO L87 Difference]: Start difference. First operand 1610 states and 2618 transitions. Second operand 18 states. [2018-07-25 08:40:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:11,605 INFO L93 Difference]: Finished difference Result 1778 states and 2887 transitions. [2018-07-25 08:40:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:40:11,605 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-07-25 08:40:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:11,607 INFO L225 Difference]: With dead ends: 1778 [2018-07-25 08:40:11,607 INFO L226 Difference]: Without dead ends: 1777 [2018-07-25 08:40:11,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=312, Invalid=1328, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:40:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-07-25 08:40:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1650. [2018-07-25 08:40:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2018-07-25 08:40:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2682 transitions. [2018-07-25 08:40:13,625 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2682 transitions. Word has length 25 [2018-07-25 08:40:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:13,625 INFO L472 AbstractCegarLoop]: Abstraction has 1650 states and 2682 transitions. [2018-07-25 08:40:13,625 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:40:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2682 transitions. [2018-07-25 08:40:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:13,626 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:13,626 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:13,626 INFO L415 AbstractCegarLoop]: === Iteration 161 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1741678744, now seen corresponding path program 3 times [2018-07-25 08:40:13,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:13,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:13,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:40:13,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:40:13,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:40:13,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:40:13,643 INFO L87 Difference]: Start difference. First operand 1650 states and 2682 transitions. Second operand 17 states. [2018-07-25 08:40:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:15,933 INFO L93 Difference]: Finished difference Result 1836 states and 2973 transitions. [2018-07-25 08:40:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:40:15,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-25 08:40:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:15,935 INFO L225 Difference]: With dead ends: 1836 [2018-07-25 08:40:15,935 INFO L226 Difference]: Without dead ends: 1835 [2018-07-25 08:40:15,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:40:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-07-25 08:40:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1762. [2018-07-25 08:40:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2018-07-25 08:40:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2868 transitions. [2018-07-25 08:40:18,081 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2868 transitions. Word has length 25 [2018-07-25 08:40:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:18,081 INFO L472 AbstractCegarLoop]: Abstraction has 1762 states and 2868 transitions. [2018-07-25 08:40:18,081 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:40:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2868 transitions. [2018-07-25 08:40:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:18,082 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:18,082 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:18,082 INFO L415 AbstractCegarLoop]: === Iteration 162 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:18,082 INFO L82 PathProgramCache]: Analyzing trace with hash -463321892, now seen corresponding path program 3 times [2018-07-25 08:40:18,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:18,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:18,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:40:18,102 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:40:18,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:40:18,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:40:18,103 INFO L87 Difference]: Start difference. First operand 1762 states and 2868 transitions. Second operand 17 states. [2018-07-25 08:40:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:21,077 INFO L93 Difference]: Finished difference Result 2066 states and 3329 transitions. [2018-07-25 08:40:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:40:21,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-07-25 08:40:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:21,080 INFO L225 Difference]: With dead ends: 2066 [2018-07-25 08:40:21,080 INFO L226 Difference]: Without dead ends: 2064 [2018-07-25 08:40:21,081 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=2366, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:40:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2018-07-25 08:40:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1772. [2018-07-25 08:40:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-07-25 08:40:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2884 transitions. [2018-07-25 08:40:23,270 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2884 transitions. Word has length 25 [2018-07-25 08:40:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:23,270 INFO L472 AbstractCegarLoop]: Abstraction has 1772 states and 2884 transitions. [2018-07-25 08:40:23,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:40:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2884 transitions. [2018-07-25 08:40:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:23,271 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:23,271 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:23,271 INFO L415 AbstractCegarLoop]: === Iteration 163 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1911500712, now seen corresponding path program 1 times [2018-07-25 08:40:23,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:23,285 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:23,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:40:23,285 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:40:23,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:40:23,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:40:23,286 INFO L87 Difference]: Start difference. First operand 1772 states and 2884 transitions. Second operand 14 states. [2018-07-25 08:40:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:25,704 INFO L93 Difference]: Finished difference Result 1956 states and 3171 transitions. [2018-07-25 08:40:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:40:25,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-25 08:40:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:25,706 INFO L225 Difference]: With dead ends: 1956 [2018-07-25 08:40:25,706 INFO L226 Difference]: Without dead ends: 1955 [2018-07-25 08:40:25,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:40:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2018-07-25 08:40:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1793. [2018-07-25 08:40:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-07-25 08:40:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2918 transitions. [2018-07-25 08:40:27,933 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2918 transitions. Word has length 25 [2018-07-25 08:40:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:27,933 INFO L472 AbstractCegarLoop]: Abstraction has 1793 states and 2918 transitions. [2018-07-25 08:40:27,933 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:40:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2918 transitions. [2018-07-25 08:40:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:27,934 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:27,934 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:27,934 INFO L415 AbstractCegarLoop]: === Iteration 164 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1586218584, now seen corresponding path program 1 times [2018-07-25 08:40:27,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:27,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:27,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:40:27,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:40:27,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:40:27,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:40:27,962 INFO L87 Difference]: Start difference. First operand 1793 states and 2918 transitions. Second operand 16 states. [2018-07-25 08:40:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:30,427 INFO L93 Difference]: Finished difference Result 1932 states and 3141 transitions. [2018-07-25 08:40:30,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:40:30,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 08:40:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:30,429 INFO L225 Difference]: With dead ends: 1932 [2018-07-25 08:40:30,429 INFO L226 Difference]: Without dead ends: 1931 [2018-07-25 08:40:30,430 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:40:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2018-07-25 08:40:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1891. [2018-07-25 08:40:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-07-25 08:40:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3080 transitions. [2018-07-25 08:40:32,764 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3080 transitions. Word has length 25 [2018-07-25 08:40:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:32,764 INFO L472 AbstractCegarLoop]: Abstraction has 1891 states and 3080 transitions. [2018-07-25 08:40:32,764 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:40:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3080 transitions. [2018-07-25 08:40:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:32,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:32,766 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:32,766 INFO L415 AbstractCegarLoop]: === Iteration 165 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash -209412774, now seen corresponding path program 1 times [2018-07-25 08:40:32,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:32,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:32,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:40:32,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:40:32,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:40:32,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:40:32,787 INFO L87 Difference]: Start difference. First operand 1891 states and 3080 transitions. Second operand 14 states. [2018-07-25 08:40:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:35,651 INFO L93 Difference]: Finished difference Result 2086 states and 3386 transitions. [2018-07-25 08:40:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:40:35,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-07-25 08:40:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:35,654 INFO L225 Difference]: With dead ends: 2086 [2018-07-25 08:40:35,654 INFO L226 Difference]: Without dead ends: 2085 [2018-07-25 08:40:35,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:40:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2018-07-25 08:40:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1866. [2018-07-25 08:40:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2018-07-25 08:40:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 3042 transitions. [2018-07-25 08:40:38,140 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 3042 transitions. Word has length 25 [2018-07-25 08:40:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:40:38,141 INFO L472 AbstractCegarLoop]: Abstraction has 1866 states and 3042 transitions. [2018-07-25 08:40:38,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:40:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3042 transitions. [2018-07-25 08:40:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:40:38,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:40:38,142 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:40:38,142 INFO L415 AbstractCegarLoop]: === Iteration 166 === [productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:40:38,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1006660774, now seen corresponding path program 1 times [2018-07-25 08:40:38,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:40:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:40:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:40:38,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:40:38,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:40:38,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:40:38,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:40:38,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:40:38,158 INFO L87 Difference]: Start difference. First operand 1866 states and 3042 transitions. Second operand 16 states. [2018-07-25 08:40:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:40:40,789 INFO L93 Difference]: Finished difference Result 1936 states and 3146 transitions. [2018-07-25 08:40:40,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:40:40,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-07-25 08:40:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:40:40,791 INFO L225 Difference]: With dead ends: 1936 [2018-07-25 08:40:40,791 INFO L226 Difference]: Without dead ends: 1935 [2018-07-25 08:40:40,791 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:40:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. Received shutdown request... [2018-07-25 08:40:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1796. [2018-07-25 08:40:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-07-25 08:40:43,263 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:40:43,267 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:40:43,268 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:40:43 BoogieIcfgContainer [2018-07-25 08:40:43,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:40:43,269 INFO L168 Benchmark]: Toolchain (without parser) took 259514.94 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -729.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-25 08:40:43,271 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:40:43,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:40:43,272 INFO L168 Benchmark]: Boogie Preprocessor took 25.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:40:43,272 INFO L168 Benchmark]: RCFGBuilder took 298.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:40:43,272 INFO L168 Benchmark]: TraceAbstraction took 259142.50 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -740.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-25 08:40:43,275 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.22 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.51 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 25.46 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 298.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259142.50 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -740.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 259.0s OverallTime, 166 OverallIterations, 4 TraceHistogramMax, 145.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6220 SDtfs, 16251 SDslu, 15859 SDs, 0 SdLazy, 95006 SolverSat, 6604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3870 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3721 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22074 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1891occurred in iteration=164, 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: 109.8s AutomataMinimizationTime, 166 MinimizatonAttempts, 15834 StatesRemovedByMinimization, 162 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2857 NumberOfCodeBlocks, 2857 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 2691 ConstructedInterpolants, 0 QuantifiedInterpolants, 295447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 166 InterpolantComputations, 10 PerfectInterpolantSequences, 272/1466 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.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-40-43-288.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-40-43-288.csv Completed graceful shutdown