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/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:19:33,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:19:33,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:19:33,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:19:33,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:19:33,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:19:33,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:19:33,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:19:33,749 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:19:33,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:19:33,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:19:33,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:19:33,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:19:33,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:19:33,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:19:33,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:19:33,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:19:33,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:19:33,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:19:33,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:19:33,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:19:33,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:19:33,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:19:33,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:19:33,767 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:19:33,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:19:33,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:19:33,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:19:33,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:19:33,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:19:33,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:19:33,773 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:19:33,773 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:19:33,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:19:33,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:19:33,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:19:33,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:19:33,783 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:19:33,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:19:33,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:19:33,785 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:19:33,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:19:33,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:19:33,786 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:19:33,786 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:19:33,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:19:33,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:19:33,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:19:33,862 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:19:33,863 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:19:33,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-25 13:19:33,864 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-07-25 13:19:33,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:19:33,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:19:33,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:19:33,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:19:33,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:19:33,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:19:33,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:19:33,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:19:33,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:19:33,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:33,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:19:33,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:19:33,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:19:33,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:19:33,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/1) ... [2018-07-25 13:19:34,065 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-25 13:19:34,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:19:34,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:19:34,183 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:19:34,183 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:19:34 BoogieIcfgContainer [2018-07-25 13:19:34,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:19:34,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:19:34,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:19:34,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:19:34,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:33" (1/2) ... [2018-07-25 13:19:34,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781c2394 and model type count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:19:34, skipping insertion in model container [2018-07-25 13:19:34,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:19:34" (2/2) ... [2018-07-25 13:19:34,193 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-07-25 13:19:34,203 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:19:34,211 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:19:34,260 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:19:34,261 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:19:34,261 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:19:34,262 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:19:34,262 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:19:34,262 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:19:34,262 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:19:34,262 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:19:34,263 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:19:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 13:19:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:19:34,288 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:34,289 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:19:34,290 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-07-25 13:19:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:34,382 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 13:19:34,384 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:19:34,385 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:19:34,389 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:19:34,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:19:34,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:19:34,404 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 13:19:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:34,430 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-07-25 13:19:34,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:19:34,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:19:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:34,442 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:19:34,442 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:19:34,446 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:19:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:19:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:19:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:19:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:19:34,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:19:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:34,484 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:19:34,484 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:19:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:19:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:19:34,485 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:34,485 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:19:34,486 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-07-25 13:19:34,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:34,512 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 13:19:34,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:34,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:19:34,515 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:19:34,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:19:34,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:19:34,516 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:19:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:34,532 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:19:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:19:34,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:19:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:34,534 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:19:34,534 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:19:34,536 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:19:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:19:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:19:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:19:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:19:34,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:19:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:34,540 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:19:34,540 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:19:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:19:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:19:34,541 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:34,541 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:19:34,541 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-07-25 13:19:34,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:34,577 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 13:19:34,577 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:34,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:19:34,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:19:34,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:19:34,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:19:34,579 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:19:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:34,638 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:19:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:19:34,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:19:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:34,639 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:19:34,639 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:19:34,640 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:19:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:19:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:19:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:19:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:19:34,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:19:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:34,644 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:19:34,644 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:19:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:19:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:19:34,645 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:34,645 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:19:34,646 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-07-25 13:19:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:34,692 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 13:19:34,692 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:34,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:19:34,693 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:19:34,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:19:34,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:19:34,694 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:19:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:34,778 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:19:34,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:19:34,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:19:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:34,780 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:19:34,780 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:19:34,781 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:19:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:19:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:19:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:19:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:19:34,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:19:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:34,785 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:19:34,785 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:19:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:19:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:19:34,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:34,786 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:19:34,786 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-07-25 13:19:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:34,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:34,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:19:34,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:19:34,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:19:34,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:19:34,869 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:19:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,012 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:19:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:19:35,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:19:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,014 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:19:35,014 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:19:35,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:19:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:19:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:19:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:19:35,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:19:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,025 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:19:35,025 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:19:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:19:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:19:35,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,028 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:19:35,030 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-07-25 13:19:35,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:35,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:19:35,100 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:19:35,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:19:35,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:19:35,101 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:19:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,167 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:19:35,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:19:35,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:19:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,171 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:19:35,171 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:19:35,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:19:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:19:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:19:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:19:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:19:35,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:19:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,178 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:19:35,179 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:19:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:19:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:19:35,182 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,183 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:19:35,183 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-07-25 13:19:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:35,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:19:35,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:19:35,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:19:35,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:19:35,247 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:19:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,318 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:19:35,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:19:35,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:19:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,319 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:19:35,319 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:19:35,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:19:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:19:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:19:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:19:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:19:35,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:19:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,325 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:19:35,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:19:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:19:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:19:35,326 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,327 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:19:35,327 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-07-25 13:19:35,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:35,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:19:35,371 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:19:35,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:19:35,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:19:35,372 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:19:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,491 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:19:35,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:19:35,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:19:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,493 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:19:35,493 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:19:35,494 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:19:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:19:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:19:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:19:35,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:19:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,501 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:19:35,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:19:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:19:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:19:35,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,503 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:19:35,503 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-07-25 13:19:35,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:35,566 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,566 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:35,569 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:35,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:35,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:35,570 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:19:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,686 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:19:35,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:19:35,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:19:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,687 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:19:35,687 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:19:35,688 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:19:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:19:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:19:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:19:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:19:35,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:19:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,693 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:19:35,693 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:19:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:19:35,694 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,694 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:19:35,694 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-07-25 13:19:35,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:35,745 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,745 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:35,746 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:35,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:35,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:35,748 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:19:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:35,880 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:19:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:19:35,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:19:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:35,882 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:19:35,883 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:19:35,884 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:19:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:19:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:19:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:19:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:19:35,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:19:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:35,894 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:19:35,894 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:19:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:19:35,895 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:35,895 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:19:35,897 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-07-25 13:19:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:35,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:35,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:19:35,975 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:19:35,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:19:35,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:19:35,976 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:19:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:36,142 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:19:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:19:36,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:19:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:36,144 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:19:36,145 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:19:36,146 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:19:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:19:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:19:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:19:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:19:36,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:19:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:36,154 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:19:36,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:19:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:19:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:19:36,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:36,155 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:19:36,156 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-07-25 13:19:36,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:36,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:36,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:19:36,236 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:19:36,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:19:36,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:19:36,237 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:19:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:36,395 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:19:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:19:36,395 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:19:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:36,396 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:19:36,396 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:19:36,397 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:19:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:19:36,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:19:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:19:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:19:36,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:19:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:36,402 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:19:36,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:19:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:19:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:19:36,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:36,403 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:19:36,403 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-07-25 13:19:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:36,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:36,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:19:36,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:19:36,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:19:36,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:19:36,472 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 13:19:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:36,650 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:19:36,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:19:36,650 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 13:19:36,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:36,651 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:19:36,651 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:19:36,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:19:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:19:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:19:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:19:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:19:36,657 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:19:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:36,657 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:19:36,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:19:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:19:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:19:36,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:36,658 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 13:19:36,659 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-07-25 13:19:36,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:36,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:36,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:19:36,732 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:19:36,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:19:36,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:36,733 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 13:19:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:36,937 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:19:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:19:36,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 13:19:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:36,938 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:19:36,939 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:19:36,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:19:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:19:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:19:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:19:36,946 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:19:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:36,946 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:19:36,946 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:19:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:19:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:19:36,947 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:36,947 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 13:19:36,948 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-07-25 13:19:36,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:37,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:37,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:19:37,048 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:19:37,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:19:37,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:37,050 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 13:19:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:37,290 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:19:37,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:19:37,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 13:19:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:37,295 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:19:37,295 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:19:37,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:19:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:19:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:19:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:19:37,304 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:19:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:37,304 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:19:37,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:19:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:19:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:19:37,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:37,306 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 13:19:37,306 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-07-25 13:19:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:37,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:37,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:19:37,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:19:37,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:19:37,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:19:37,426 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 13:19:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:37,688 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:19:37,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:19:37,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 13:19:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:37,689 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:19:37,690 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:19:37,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:19:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:19:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:19:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:19:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:19:37,700 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:19:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:37,700 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:19:37,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:19:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:19:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:19:37,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:37,702 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 13:19:37,702 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-07-25 13:19:37,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:37,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:37,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:19:37,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:19:37,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:19:37,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:19:37,812 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 13:19:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:38,143 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:19:38,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:19:38,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 13:19:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:38,144 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:19:38,144 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:19:38,145 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:19:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:19:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:19:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:19:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:19:38,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:19:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:38,150 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:19:38,150 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:19:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:19:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:38,151 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:38,151 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 13:19:38,151 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-07-25 13:19:38,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:38,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:38,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:19:38,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:19:38,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:19:38,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:19:38,257 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 13:19:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:38,552 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:19:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:19:38,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 13:19:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:38,553 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:19:38,553 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:19:38,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:19:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:19:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:19:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:19:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:19:38,559 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:19:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:38,559 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:19:38,559 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:19:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:19:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:19:38,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:38,560 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 13:19:38,560 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-07-25 13:19:38,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:38,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:38,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:19:38,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:19:38,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:19:38,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:19:38,668 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 13:19:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:38,967 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:19:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:19:38,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 13:19:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:38,968 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:19:38,968 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:19:38,969 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:19:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:19:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:19:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:19:38,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:19:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:38,974 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:19:38,974 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:19:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:19:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:19:38,975 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:38,975 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 13:19:38,975 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-07-25 13:19:38,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:39,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:39,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:19:39,092 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:19:39,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:19:39,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:19:39,093 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 13:19:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:39,448 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:19:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:19:39,448 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 13:19:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:39,449 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:19:39,449 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:19:39,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:19:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:19:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:19:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:19:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:19:39,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:19:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:39,455 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:19:39,455 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:19:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:19:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:19:39,456 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:39,456 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 13:19:39,456 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:39,456 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-07-25 13:19:39,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:39,580 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:39,580 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:19:39,581 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:19:39,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:19:39,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:19:39,581 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 13:19:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:39,990 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:19:39,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:19:39,990 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 13:19:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:39,991 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:19:39,991 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:19:39,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:19:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:19:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:19:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:19:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:19:39,998 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:19:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:39,998 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:19:39,998 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:19:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:19:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:19:39,999 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:39,999 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 13:19:40,000 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-07-25 13:19:40,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:40,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:40,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:19:40,154 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:19:40,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:19:40,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:19:40,155 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 13:19:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:40,612 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:19:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:19:40,613 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 13:19:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:40,614 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:19:40,614 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:19:40,615 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:19:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:19:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:19:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:19:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:19:40,620 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:19:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:40,620 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:19:40,621 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:19:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:19:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:19:40,621 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:40,622 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 13:19:40,622 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:40,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-07-25 13:19:40,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:40,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:40,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:19:40,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:19:40,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:19:40,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:19:40,762 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 13:19:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:41,257 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:19:41,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:19:41,257 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 13:19:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:41,258 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:19:41,258 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:19:41,260 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:19:41,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:19:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:19:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:19:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:19:41,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:19:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:41,265 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:19:41,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:19:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:19:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:19:41,266 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:41,266 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 13:19:41,267 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-07-25 13:19:41,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:41,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:41,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:19:41,438 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:19:41,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:19:41,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:19:41,439 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 13:19:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:41,970 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:19:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:19:41,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 13:19:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:41,971 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:19:41,971 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:19:41,973 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:19:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:19:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:19:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:19:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:19:41,978 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:19:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:41,979 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:19:41,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:19:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:19:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:19:41,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:41,980 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 13:19:41,980 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:41,980 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-07-25 13:19:41,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:42,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:42,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:19:42,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:19:42,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:19:42,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:19:42,150 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 13:19:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:42,788 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:19:42,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:19:42,788 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 13:19:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:42,789 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:19:42,789 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:19:42,791 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:19:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:19:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:19:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:19:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:19:42,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:19:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:42,802 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:19:42,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:19:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:19:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:19:42,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:42,804 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 13:19:42,804 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-07-25 13:19:42,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:42,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:42,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:19:42,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:19:42,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:19:42,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:19:42,997 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 13:19:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:43,519 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:19:43,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:19:43,519 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 13:19:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:43,520 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:19:43,520 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:19:43,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:19:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:19:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:19:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:19:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:19:43,527 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:19:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:43,527 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:19:43,527 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:19:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:19:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:19:43,528 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:43,528 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 13:19:43,528 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-07-25 13:19:43,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:43,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:43,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:19:43,714 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:19:43,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:19:43,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:43,715 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 13:19:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:44,301 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:19:44,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:19:44,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 13:19:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:44,302 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:19:44,302 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:19:44,303 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:19:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:19:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:19:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:19:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:19:44,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:19:44,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:44,309 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:19:44,309 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:19:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:19:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:19:44,310 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:44,310 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 13:19:44,310 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:44,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-07-25 13:19:44,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:44,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:44,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:19:44,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:19:44,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:19:44,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:19:44,500 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 13:19:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:45,164 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:19:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:19:45,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 13:19:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:45,165 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:19:45,166 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:19:45,167 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:19:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:19:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:19:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:19:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:19:45,178 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:19:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:45,178 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:19:45,178 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:19:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:19:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:19:45,179 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:45,183 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 13:19:45,183 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-07-25 13:19:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:45,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:45,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:19:45,425 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:19:45,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:19:45,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:45,426 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 13:19:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:46,130 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:19:46,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:19:46,131 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 13:19:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:46,131 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:19:46,131 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:19:46,133 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:19:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:19:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:19:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:19:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:19:46,146 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:19:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:46,146 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:19:46,146 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:19:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:19:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:19:46,147 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:46,147 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 13:19:46,147 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-07-25 13:19:46,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:46,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:46,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:19:46,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:19:46,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:19:46,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:19:46,353 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 13:19:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:47,047 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:19:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:19:47,048 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 13:19:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:47,048 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:19:47,048 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:19:47,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:19:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:19:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:19:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:19:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:19:47,056 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:19:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:47,056 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:19:47,056 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:19:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:19:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:19:47,057 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:47,057 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 13:19:47,057 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-07-25 13:19:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:47,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:47,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:19:47,262 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:19:47,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:19:47,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:19:47,263 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 13:19:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:48,074 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:19:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:19:48,074 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 13:19:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:48,075 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:19:48,075 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:19:48,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:19:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:19:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:19:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:19:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:19:48,084 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:19:48,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:48,084 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:19:48,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:19:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:19:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:19:48,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:48,085 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 13:19:48,085 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-07-25 13:19:48,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:48,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:48,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:19:48,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:19:48,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:19:48,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:19:48,304 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 13:19:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:49,072 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:19:49,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:19:49,072 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 13:19:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:49,073 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:19:49,073 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:19:49,075 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:19:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:19:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:19:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:19:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:19:49,085 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:19:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:49,085 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:19:49,085 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:19:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:19:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:19:49,086 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:49,086 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 13:19:49,091 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-07-25 13:19:49,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:49,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:49,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:19:49,305 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:19:49,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:19:49,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:19:49,306 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 13:19:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,143 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:19:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:19:50,144 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 13:19:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,144 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:19:50,144 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:19:50,147 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:19:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:19:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:19:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:19:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:19:50,152 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:19:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:50,152 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:19:50,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:19:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:19:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:19:50,153 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,153 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 13:19:50,153 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-07-25 13:19:50,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:50,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:50,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:19:50,405 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:19:50,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:19:50,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:19:50,407 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 13:19:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,486 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:19:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:19:51,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 13:19:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,487 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:19:51,487 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:19:51,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:19:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:19:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:19:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:19:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:19:51,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:19:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,495 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:19:51,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:19:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:19:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:19:51,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,496 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 13:19:51,496 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-07-25 13:19:51,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:19:51,727 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:19:51,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:19:51,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:19:51,728 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 13:19:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,625 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:19:52,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:19:52,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 13:19:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,626 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:19:52,626 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:19:52,627 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:19:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:19:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:19:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:19:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:19:52,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:19:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,638 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:19:52,638 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:19:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:19:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:19:52,638 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,638 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 13:19:52,639 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-07-25 13:19:52,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:19:52,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:19:52,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:19:52,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:19:52,861 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 13:19:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,817 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:19:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:19:53,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 13:19:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,817 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:19:53,818 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:19:53,819 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:19:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:19:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:19:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:19:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:19:53,823 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:19:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,823 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:19:53,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:19:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:19:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:19:53,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,824 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 13:19:53,825 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-07-25 13:19:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:19:54,067 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:19:54,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:19:54,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:54,068 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 13:19:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,089 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:19:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:19:55,089 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 13:19:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,089 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:19:55,090 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:19:55,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:19:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:19:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:19:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:19:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:19:55,095 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:19:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,095 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:19:55,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:19:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:19:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:19:55,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,096 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 13:19:55,096 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-07-25 13:19:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,344 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:19:55,345 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:19:55,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:19:55,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:19:55,346 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 13:19:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:56,497 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:19:56,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:19:56,497 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 13:19:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:56,498 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:19:56,498 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:19:56,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:19:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:19:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:19:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:19:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:19:56,505 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:19:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:56,505 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:19:56,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:19:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:19:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:19:56,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:56,507 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 13:19:56,507 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-07-25 13:19:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:56,759 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:56,759 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:19:56,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:19:56,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:19:56,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:19:56,760 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 13:19:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:57,908 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:19:57,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:19:57,909 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 13:19:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:57,909 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:19:57,910 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:19:57,911 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:19:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:19:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:19:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:19:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:19:57,916 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:19:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,916 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:19:57,916 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:19:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:19:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:19:57,917 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,917 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 13:19:57,917 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-07-25 13:19:57,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:58,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:58,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:19:58,183 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:19:58,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:19:58,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:19:58,184 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 13:19:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:59,197 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:19:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:19:59,197 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 13:19:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:59,198 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:19:59,198 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:19:59,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:19:59,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:19:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:19:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:19:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:19:59,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:19:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:59,203 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:19:59,203 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:19:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:19:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:19:59,204 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:59,204 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 13:19:59,204 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:59,204 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-07-25 13:19:59,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:59,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:59,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:19:59,423 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:19:59,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:19:59,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:19:59,424 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 13:20:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:00,387 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:20:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:20:00,387 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 13:20:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:00,388 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:20:00,388 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:20:00,389 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:20:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:20:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:20:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:20:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:20:00,393 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:20:00,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:00,394 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:20:00,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:20:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:20:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:20:00,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:00,394 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 13:20:00,395 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-07-25 13:20:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:00,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:00,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:20:00,605 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:20:00,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:20:00,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:20:00,606 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 13:20:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:01,605 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:20:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:20:01,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 13:20:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:01,605 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:20:01,606 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:20:01,607 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:20:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:20:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:20:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:20:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:20:01,611 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:20:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:01,612 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:20:01,612 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:20:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:20:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:20:01,612 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:01,613 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 13:20:01,613 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-07-25 13:20:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:01,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:01,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:20:01,832 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:20:01,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:20:01,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:20:01,833 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 13:20:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:02,794 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:20:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:20:02,794 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 13:20:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:02,795 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:20:02,795 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:20:02,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:20:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:20:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:20:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:20:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:20:02,801 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:20:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:02,801 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:20:02,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:20:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:20:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:20:02,802 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:02,802 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 13:20:02,802 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-07-25 13:20:02,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:03,035 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:03,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:20:03,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:20:03,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:20:03,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:20:03,037 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 13:20:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:04,240 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:20:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:20:04,240 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 13:20:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:04,241 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:20:04,241 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:20:04,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:20:04,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:20:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:20:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:20:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:20:04,246 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:20:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:04,247 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:20:04,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:20:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:20:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:20:04,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:04,247 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 13:20:04,248 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-07-25 13:20:04,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:04,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:04,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:20:04,491 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:20:04,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:20:04,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:20:04,491 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 13:20:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:05,743 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:20:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:20:05,744 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 13:20:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:05,744 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:20:05,745 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:20:05,745 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:20:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:20:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:20:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:20:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:20:05,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:20:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:05,750 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:20:05,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:20:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:20:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:20:05,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:05,751 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 13:20:05,751 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-07-25 13:20:05,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:06,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:20:06,001 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:20:06,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:20:06,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:20:06,001 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 13:20:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,148 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:20:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:20:07,149 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 13:20:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,149 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:20:07,149 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:20:07,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:20:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:20:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:20:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:20:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:20:07,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:20:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,155 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:20:07,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:20:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:20:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:20:07,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,156 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 13:20:07,156 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-07-25 13:20:07,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:20:07,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:20:07,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:20:07,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:20:07,441 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 13:20:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:08,659 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:20:08,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:20:08,660 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 13:20:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:08,660 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:20:08,660 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:20:08,661 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:20:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:20:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:20:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:20:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:20:08,664 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:20:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:08,664 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:20:08,664 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:20:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:20:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:20:08,665 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:08,665 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 13:20:08,665 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-07-25 13:20:08,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:08,910 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:08,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:20:08,911 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:20:08,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:20:08,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:20:08,912 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 13:20:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:10,346 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:20:10,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:20:10,346 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 13:20:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:10,347 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:20:10,347 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:20:10,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:20:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:20:10,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:20:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:20:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:20:10,352 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:20:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:10,352 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:20:10,352 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:20:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:20:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:20:10,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:10,353 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 13:20:10,353 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:10,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-07-25 13:20:10,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:10,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:10,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:20:10,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:20:10,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:20:10,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:20:10,631 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 13:20:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:12,106 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:20:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:20:12,106 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 13:20:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:12,107 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:20:12,107 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:20:12,108 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:20:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:20:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:20:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:20:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:20:12,111 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:20:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:12,112 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:20:12,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:20:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:20:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:20:12,112 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:12,112 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 13:20:12,113 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:12,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-07-25 13:20:12,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:12,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:12,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:20:12,412 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:20:12,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:20:12,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:20:12,413 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 13:20:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:13,838 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:20:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:20:13,838 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 13:20:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:13,839 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:20:13,839 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:20:13,840 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:20:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:20:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:20:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:20:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:20:13,845 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:20:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:13,845 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:20:13,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:20:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:20:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:20:13,846 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:13,846 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 13:20:13,846 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-07-25 13:20:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:14,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:14,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:20:14,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:20:14,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:20:14,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:20:14,140 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 13:20:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:16,091 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:20:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:20:16,092 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 13:20:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:16,092 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:20:16,093 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:20:16,094 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:20:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:20:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:20:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:20:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:20:16,099 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:20:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:16,099 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:20:16,099 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:20:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:20:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:20:16,100 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:16,100 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 13:20:16,100 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-07-25 13:20:16,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:16,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:16,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:20:16,547 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:20:16,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:20:16,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:20:16,548 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 13:20:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:18,255 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:20:18,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:20:18,255 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 13:20:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:18,256 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:20:18,256 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:20:18,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:20:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:20:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:20:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:20:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:20:18,261 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:20:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:18,262 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:20:18,262 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:20:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:20:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:20:18,263 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:18,263 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 13:20:18,263 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-07-25 13:20:18,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:18,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:18,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:20:18,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:20:18,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:20:18,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:20:18,556 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 13:20:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:20,273 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:20:20,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:20:20,273 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 13:20:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:20,273 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:20:20,274 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:20:20,275 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:20:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:20:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:20:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:20:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:20:20,278 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:20:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:20,279 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:20:20,279 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:20:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:20:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:20:20,279 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:20,279 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 13:20:20,279 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-07-25 13:20:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:20,675 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:20,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:20:20,675 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:20:20,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:20:20,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:20:20,676 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 13:20:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:22,397 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:20:22,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:20:22,397 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 13:20:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:22,397 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:20:22,398 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:20:22,399 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:20:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:20:22,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:20:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:20:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:20:22,402 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:20:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:22,402 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:20:22,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:20:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:20:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:20:22,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:22,403 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 13:20:22,403 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-07-25 13:20:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:22,718 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:22,718 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:20:22,719 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:20:22,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:20:22,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:20:22,719 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 13:20:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:24,569 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:20:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:20:24,569 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 13:20:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:24,570 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:20:24,570 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:20:24,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:20:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:20:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:20:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:20:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:20:24,575 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:20:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:24,575 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:20:24,575 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:20:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:20:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:20:24,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:24,577 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 13:20:24,577 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-07-25 13:20:24,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:24,934 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:24,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:20:24,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:20:24,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:20:24,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:20:24,935 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 13:20:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:26,971 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:20:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:20:26,971 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 13:20:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:26,972 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:20:26,972 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:20:26,973 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:20:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:20:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:20:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:20:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:20:26,978 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:20:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:26,979 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:20:26,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:20:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:20:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:20:26,979 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:26,980 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 13:20:26,980 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-07-25 13:20:26,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:27,348 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:27,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:20:27,349 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:20:27,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:20:27,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:20:27,349 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 13:20:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:29,379 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:20:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:20:29,379 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 13:20:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:29,380 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:20:29,380 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:20:29,381 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:20:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:20:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:20:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:20:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:20:29,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:20:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:29,384 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:20:29,384 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:20:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:20:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:20:29,385 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:29,385 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 13:20:29,385 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-07-25 13:20:29,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:29,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:29,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:20:29,781 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:20:29,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:20:29,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:20:29,782 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 13:20:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:31,971 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:20:31,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:20:31,971 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 13:20:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:31,971 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:20:31,971 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:20:31,972 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:20:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:20:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:20:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:20:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:20:31,977 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:20:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:31,977 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:20:31,977 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:20:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:20:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:20:31,978 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:31,978 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 13:20:31,978 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:31,978 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-07-25 13:20:31,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:32,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:32,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:20:32,397 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:20:32,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:20:32,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:20:32,397 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 13:20:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:34,602 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:20:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:20:34,602 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 13:20:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:34,603 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:20:34,603 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:20:34,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:20:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:20:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:20:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:20:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:20:34,608 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:20:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:34,608 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:20:34,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:20:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:20:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:20:34,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:34,609 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 13:20:34,609 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-07-25 13:20:34,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:35,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:35,051 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:20:35,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:20:35,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:20:35,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:20:35,052 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 13:20:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:37,450 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:20:37,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:20:37,450 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 13:20:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:37,451 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:20:37,451 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:20:37,452 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:20:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:20:37,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:20:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:20:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:20:37,458 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:20:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:37,459 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:20:37,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:20:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:20:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:20:37,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:37,460 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 13:20:37,460 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-07-25 13:20:37,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:37,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:37,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:20:37,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:20:37,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:20:37,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:20:37,993 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 13:20:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:40,238 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:20:40,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:20:40,238 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 13:20:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:40,239 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:20:40,239 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:20:40,240 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:20:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:20:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:20:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:20:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:20:40,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:20:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:40,246 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:20:40,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:20:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:20:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:20:40,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:40,247 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 13:20:40,248 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-07-25 13:20:40,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:40,762 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:40,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:20:40,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:20:40,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:20:40,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:20:40,763 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 13:20:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:43,343 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:20:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:20:43,344 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 13:20:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:43,344 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:20:43,344 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:20:43,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:20:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:20:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:20:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:20:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:20:43,352 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:20:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:43,352 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:20:43,353 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:20:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:20:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:20:43,354 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:43,354 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 13:20:43,354 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:43,354 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-07-25 13:20:43,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:43,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:43,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:20:43,823 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:20:43,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:20:43,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:20:43,824 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 13:20:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:46,241 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:20:46,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:20:46,241 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 13:20:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:46,241 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:20:46,241 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:20:46,243 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:20:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:20:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:20:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:20:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:20:46,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:20:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:46,248 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:20:46,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:20:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:20:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:20:46,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:46,249 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 13:20:46,250 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-07-25 13:20:46,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:46,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:46,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:20:46,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:20:46,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:20:46,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:20:46,713 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 13:20:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:49,226 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:20:49,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:20:49,226 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 13:20:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:49,227 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:20:49,227 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:20:49,229 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:20:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:20:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:20:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:20:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:20:49,234 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:20:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:49,235 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:20:49,235 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:20:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:20:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:20:49,236 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:49,236 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 13:20:49,236 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:49,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-07-25 13:20:49,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:49,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:49,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:20:49,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:20:49,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:20:49,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:20:49,682 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 13:20:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:52,353 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:20:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:20:52,353 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 13:20:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:52,354 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:20:52,354 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:20:52,355 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:20:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:20:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:20:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:20:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:20:52,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:20:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:52,360 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:20:52,361 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:20:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:20:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:20:52,361 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:52,361 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 13:20:52,362 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-07-25 13:20:52,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:52,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:52,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:20:52,835 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:20:52,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:20:52,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:20:52,835 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 13:20:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:55,595 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:20:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:20:55,595 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 13:20:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:55,596 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:20:55,596 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:20:55,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:20:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:20:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:20:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:20:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:20:55,603 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:20:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:55,603 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:20:55,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:20:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:20:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:20:55,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:55,604 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 13:20:55,604 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-07-25 13:20:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:56,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:56,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:20:56,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:20:56,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:20:56,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:20:56,147 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 13:20:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:59,216 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:20:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:20:59,216 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 13:20:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:59,217 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:20:59,217 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:20:59,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:20:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:20:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:20:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:20:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:20:59,223 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:20:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:59,223 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:20:59,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:20:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:20:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:20:59,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:59,224 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 13:20:59,224 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-07-25 13:20:59,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:59,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:59,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:20:59,807 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:20:59,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:20:59,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:20:59,808 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 13:21:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:02,985 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:21:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:21:02,986 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 13:21:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:02,987 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:21:02,987 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:21:02,988 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:21:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:21:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:21:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:21:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:21:02,994 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:21:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:02,994 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:21:02,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:21:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:21:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:21:02,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,995 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 13:21:02,995 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-07-25 13:21:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:03,635 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:03,635 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:21:03,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:21:03,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:21:03,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:21:03,636 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 13:21:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,944 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:21:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:21:06,944 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 13:21:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,945 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:21:06,945 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:21:06,946 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:21:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:21:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:21:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:21:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:21:06,950 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:21:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,951 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:21:06,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:21:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:21:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:21:06,951 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,951 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 13:21:06,952 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-07-25 13:21:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:21:07,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:21:07,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:21:07,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:21:07,543 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 13:21:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,073 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:21:11,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:21:11,073 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 13:21:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,074 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:21:11,074 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:21:11,075 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:21:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:21:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:21:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:21:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:21:11,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:21:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,080 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:21:11,080 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:21:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:21:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:21:11,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,081 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 13:21:11,081 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-07-25 13:21:11,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:21:11,731 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:21:11,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:21:11,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:21:11,732 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 13:21:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,240 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:21:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:21:15,240 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 13:21:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,241 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:21:15,241 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:21:15,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:21:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:21:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:21:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:21:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:21:15,246 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:21:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,247 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:21:15,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:21:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:21:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:21:15,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,247 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 13:21:15,247 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-07-25 13:21:15,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:21:16,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:21:16,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:21:16,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:21:16,062 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 13:21:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:20,191 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:21:20,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:21:20,191 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 13:21:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:20,192 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:21:20,192 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:21:20,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:21:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:21:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:21:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:21:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:21:20,197 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:21:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:20,197 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:21:20,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:21:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:21:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:21:20,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:20,198 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 13:21:20,198 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-07-25 13:21:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:20,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:20,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:21:20,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:21:20,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:21:20,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:21:20,879 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 13:21:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:24,576 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:21:24,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:21:24,576 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 13:21:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:24,577 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:21:24,577 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:21:24,579 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:21:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:21:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:21:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:21:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:21:24,584 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:21:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:24,585 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:21:24,585 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:21:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:21:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:21:24,585 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:24,586 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 13:21:24,586 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-07-25 13:21:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:25,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:25,463 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:21:25,463 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:21:25,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:21:25,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:21:25,464 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 13:21:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:29,502 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:21:29,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:21:29,502 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 13:21:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:29,503 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:21:29,503 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:21:29,505 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:21:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:21:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:21:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:21:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:21:29,511 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:21:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:29,512 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:21:29,512 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:21:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:21:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:21:29,512 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:29,513 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 13:21:29,513 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-07-25 13:21:29,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:30,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:30,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:21:30,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:21:30,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:21:30,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:21:30,573 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 13:21:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:34,570 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:21:34,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:21:34,570 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 13:21:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:34,571 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:21:34,571 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:21:34,573 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:21:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:21:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:21:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:21:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:21:34,579 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:21:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:34,579 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:21:34,579 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:21:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:21:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:21:34,580 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:34,580 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 13:21:34,580 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-07-25 13:21:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:35,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:35,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:21:35,245 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:21:35,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:21:35,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:21:35,246 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 13:21:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:39,794 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:21:39,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:21:39,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 13:21:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:39,796 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:21:39,796 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:21:39,797 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:21:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:21:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:21:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:21:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:21:39,803 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:21:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:39,803 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:21:39,804 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:21:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:21:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:21:39,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:39,804 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 13:21:39,805 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-07-25 13:21:39,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:40,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:40,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:21:40,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:21:40,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:21:40,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:21:40,756 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 13:21:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:45,269 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:21:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:21:45,269 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 13:21:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:45,270 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:21:45,270 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:21:45,272 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:21:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:21:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:21:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:21:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:21:45,276 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:21:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:45,277 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:21:45,277 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:21:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:21:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:21:45,277 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:45,277 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 13:21:45,278 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-07-25 13:21:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:46,018 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:46,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:21:46,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:21:46,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:21:46,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:21:46,019 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 13:21:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:50,694 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:21:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:21:50,694 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 13:21:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:50,694 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:21:50,695 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:21:50,696 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:21:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:21:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:21:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:21:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:21:50,699 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:21:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:50,700 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:21:50,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:21:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:21:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:21:50,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:50,700 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 13:21:50,700 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-07-25 13:21:50,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:51,409 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:51,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:21:51,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:21:51,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:21:51,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:21:51,411 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 13:21:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:56,475 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:21:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:21:56,475 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 13:21:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:56,476 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:21:56,476 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:21:56,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:21:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:21:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:21:56,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:21:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:21:56,484 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:21:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:56,484 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:21:56,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:21:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:21:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:21:56,485 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:56,485 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 13:21:56,486 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-07-25 13:21:56,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:57,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:57,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:21:57,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:21:57,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:21:57,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:21:57,314 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 13:22:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:02,686 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:22:02,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:22:02,686 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 13:22:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:02,686 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:22:02,686 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:22:02,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:22:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:22:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:22:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:22:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:22:02,693 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:22:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:02,694 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:22:02,694 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:22:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:22:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:22:02,694 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:02,695 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 13:22:02,695 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:02,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-07-25 13:22:02,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:03,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:03,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:22:03,481 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:22:03,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:22:03,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:22:03,482 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 13:22:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:08,685 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:22:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:22:08,686 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 13:22:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:08,686 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:22:08,687 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:22:08,688 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:22:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:22:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:22:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:22:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:22:08,695 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:22:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:08,695 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:22:08,695 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:22:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:22:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:22:08,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:08,696 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 13:22:08,696 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-07-25 13:22:08,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:09,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:09,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:22:09,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:22:09,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:22:09,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:22:09,475 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 13:22:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:15,042 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:22:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:22:15,042 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 13:22:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:15,043 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:22:15,043 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:22:15,044 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:22:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:22:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:22:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:22:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:22:15,051 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:22:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:15,051 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:22:15,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:22:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:22:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:22:15,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:15,052 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 13:22:15,052 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-07-25 13:22:15,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:15,971 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:15,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:22:15,972 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:22:15,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:22:15,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:22:15,972 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 13:22:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:21,814 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:22:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:22:21,814 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 13:22:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:21,815 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:22:21,815 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:22:21,816 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:22:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:22:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:22:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:22:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:22:21,822 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:22:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:21,822 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:22:21,822 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:22:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:22:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:22:21,823 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:21,823 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 13:22:21,823 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-07-25 13:22:21,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:22,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:22,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:22:22,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:22:22,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:22:22,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:22:22,756 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 13:22:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:28,887 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:22:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:22:28,887 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 13:22:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:28,888 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:22:28,888 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:22:28,889 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:22:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:22:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:22:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:22:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:22:28,896 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:22:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:28,896 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:22:28,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:22:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:22:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:22:28,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:28,897 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 13:22:28,897 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:28,897 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-07-25 13:22:28,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:29,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:29,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:22:29,816 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:22:29,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:22:29,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:22:29,817 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 13:22:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:35,975 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:22:35,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:22:35,975 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 13:22:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:35,976 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:22:35,976 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:22:35,977 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:22:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:22:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:22:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:22:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:22:35,983 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:22:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:35,984 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:22:35,984 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:22:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:22:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:22:35,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:35,985 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 13:22:35,985 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-07-25 13:22:35,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:36,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:36,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:22:36,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:22:36,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:22:36,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:22:36,900 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 13:22:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:43,410 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:22:43,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:22:43,411 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 13:22:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:43,411 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:22:43,411 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:22:43,412 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:22:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:22:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 13:22:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:22:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:22:43,417 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 13:22:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:43,417 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:22:43,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:22:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:22:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:22:43,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:43,418 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 13:22:43,418 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-07-25 13:22:43,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:44,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:44,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:22:44,406 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:22:44,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:22:44,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:22:44,408 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 13:22:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:51,073 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:22:51,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:22:51,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 13:22:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:51,074 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:22:51,074 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:22:51,076 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:22:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:22:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:22:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:22:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:22:51,083 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 13:22:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:51,083 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:22:51,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:22:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:22:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:22:51,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:51,084 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 13:22:51,084 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-07-25 13:22:51,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:52,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:52,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:22:52,301 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:22:52,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:22:52,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:22:52,302 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 13:22:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:59,176 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:22:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:22:59,176 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 13:22:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:59,177 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:22:59,177 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 13:22:59,178 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:22:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 13:22:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 13:22:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:22:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:22:59,183 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 13:22:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:59,183 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:22:59,183 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:22:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:22:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:22:59,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:59,184 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 13:22:59,184 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-07-25 13:22:59,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:00,220 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:00,220 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:23:00,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:23:00,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:23:00,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:23:00,221 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 13:23:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:07,561 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:23:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:23:07,562 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 13:23:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:07,562 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:23:07,562 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:23:07,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:23:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:23:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:23:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:23:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:23:07,570 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 13:23:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:07,570 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:23:07,570 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:23:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:23:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:23:07,571 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:07,571 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 13:23:07,571 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-07-25 13:23:07,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:08,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:08,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:23:08,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:23:08,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:23:08,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:23:08,683 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 13:23:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:16,035 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:23:16,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:23:16,035 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 13:23:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:16,035 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:23:16,036 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:23:16,037 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:23:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:23:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:23:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:23:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:23:16,041 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 13:23:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:16,041 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:23:16,041 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:23:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:23:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:23:16,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:16,042 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 13:23:16,042 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-07-25 13:23:16,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:17,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:17,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:23:17,134 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:23:17,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:23:17,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:23:17,135 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 13:23:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:24,261 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:23:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:23:24,262 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 13:23:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:24,262 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:23:24,262 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:23:24,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=8463, Invalid=24843, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:23:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:23:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:23:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:23:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:23:24,269 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 13:23:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:24,269 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:23:24,269 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:23:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:23:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:23:24,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:24,270 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 13:23:24,270 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-07-25 13:23:24,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:25,606 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:25,606 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:23:25,607 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:23:25,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:23:25,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:23:25,608 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 13:23:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:32,946 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:23:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:23:32,946 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 13:23:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:32,946 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:23:32,946 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:23:32,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8648, Invalid=25392, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:23:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:23:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 13:23:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:23:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:23:32,953 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 13:23:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:32,953 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:23:32,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:23:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:23:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:23:32,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:32,954 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 13:23:32,954 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-07-25 13:23:32,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:33,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:33,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:23:33,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:23:33,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:23:33,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:23:33,999 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 13:23:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:41,235 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:23:41,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:23:41,236 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 13:23:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:41,236 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:23:41,236 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:23:41,238 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8835, Invalid=25947, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:23:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:23:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:23:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:23:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:23:41,243 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 13:23:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:41,244 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:23:41,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:23:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:23:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:23:41,244 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:41,245 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 13:23:41,245 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:41,245 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-07-25 13:23:41,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:42,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:42,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:23:42,333 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:23:42,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:23:42,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:23:42,334 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. Received shutdown request... [2018-07-25 13:23:47,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:23:47,814 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:23:47,819 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:23:47,820 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:23:47 BoogieIcfgContainer [2018-07-25 13:23:47,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:23:47,821 INFO L168 Benchmark]: Toolchain (without parser) took 253904.92 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 546.3 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -498.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-25 13:23:47,822 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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 13:23:47,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.38 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 13:23:47,823 INFO L168 Benchmark]: Boogie Preprocessor took 20.13 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 13:23:47,824 INFO L168 Benchmark]: RCFGBuilder took 203.50 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 13:23:47,826 INFO L168 Benchmark]: TraceAbstraction took 253634.94 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 546.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -508.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-25 13:23:47,831 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.38 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 20.13 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 203.50 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 253634.94 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 546.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -508.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 62 states, 96 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 156 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 253.5s OverallTime, 94 OverallIterations, 93 TraceHistogramMax, 213.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 280 SDtfs, 0 SDslu, 4371 SDs, 0 SdLazy, 9175 SolverSat, 4278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8897 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8802 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131548 ImplicationChecksByTransitivity, 226.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=93, 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: 0.4s AutomataMinimizationTime, 93 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 17.3s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 4653 NumberOfCodeBlocks, 4653 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 4559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1424255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 94 InterpolantComputations, 1 PerfectInterpolantSequences, 0/138415 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/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-23-47-849.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-23-47-849.csv Completed graceful shutdown