java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:07:05,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:07:05,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:07:05,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:07:05,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:07:05,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:07:05,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:07:05,544 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:07:05,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:07:05,547 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:07:05,548 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:07:05,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:07:05,552 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:07:05,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:07:05,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:07:05,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:07:05,565 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:07:05,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:07:05,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:07:05,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:07:05,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:07:05,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:07:05,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:07:05,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:07:05,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:07:05,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:07:05,591 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:07:05,592 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:07:05,593 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:07:05,594 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:07:05,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:07:05,598 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:07:05,598 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:07:05,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:07:05,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:07:05,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:07:05,603 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:07:05,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:07:05,619 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:07:05,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:07:05,620 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:07:05,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:07:05,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:07:05,621 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:07:05,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:07:05,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:07:05,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:07:05,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:07:05,720 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:07:05,721 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:07:05,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 08:07:05,722 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl' [2018-09-26 08:07:05,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:07:05,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:07:05,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:07:05,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:07:05,785 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:07:05,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:07:05,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:07:05,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:07:05,831 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:07:05,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:07:05,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:07:05,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:07:05,854 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:07:05,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/1) ... [2018-09-26 08:07:05,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:07:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:07:05,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:07:06,092 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:07:06,094 INFO L202 PluginConnector]: Adding new model count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:07:06 BoogieIcfgContainer [2018-09-26 08:07:06,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:07:06,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:07:06,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:07:06,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:07:06,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:07:05" (1/2) ... [2018-09-26 08:07:06,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635c8ec0 and model type count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:07:06, skipping insertion in model container [2018-09-26 08:07:06,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:07:06" (2/2) ... [2018-09-26 08:07:06,103 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 08:07:06,113 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:07:06,125 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:07:06,173 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:07:06,174 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:07:06,174 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:07:06,175 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:07:06,175 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:07:06,175 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:07:06,175 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:07:06,175 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:07:06,176 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:07:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:07:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:07:06,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,201 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:07:06,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash 947099, now seen corresponding path program 1 times [2018-09-26 08:07:06,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,292 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:07:06,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:07:06,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:07:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:07:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:07:06,311 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-26 08:07:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,352 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-09-26 08:07:06,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:07:06,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:07:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,365 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:07:06,365 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:07:06,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:07:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:07:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-09-26 08:07:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:07:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:07:06,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:07:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,408 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:07:06,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:07:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:07:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:07:06,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,409 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:07:06,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash 910108837, now seen corresponding path program 1 times [2018-09-26 08:07:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:07:06,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:07:06,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:07:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:07:06,446 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2018-09-26 08:07:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,482 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:07:06,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:07:06,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-09-26 08:07:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,483 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:07:06,483 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:07:06,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:07:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-26 08:07:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:07:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:07:06,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:07:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,491 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:07:06,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:07:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:07:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:07:06,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,492 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:07:06,493 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1558789329, now seen corresponding path program 2 times [2018-09-26 08:07:06,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:07:06,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:07:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:07:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:07:06,571 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 08:07:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,645 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:07:06,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:07:06,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 08:07:06,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,646 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:07:06,646 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:07:06,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:07:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-26 08:07:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:07:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:07:06,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:07:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,653 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:07:06,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:07:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:07:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:07:06,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,654 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:07:06,654 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 946987833, now seen corresponding path program 3 times [2018-09-26 08:07:06,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:06,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:07:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:07:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:07:06,704 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-09-26 08:07:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,758 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:07:06,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:07:06,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:07:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,760 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:07:06,760 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:07:06,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:07:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-26 08:07:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:07:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:07:06,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:07:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,776 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:07:06,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:07:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:07:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:07:06,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,778 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:07:06,778 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash -477812541, now seen corresponding path program 4 times [2018-09-26 08:07:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:06,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:06,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:06,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:06,834 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 08:07:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,904 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:07:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:07:06,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:07:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,905 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:07:06,905 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:07:06,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:07:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-09-26 08:07:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:07:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:07:06,911 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:07:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:06,912 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:07:06,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:07:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:07:06,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:06,913 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:07:06,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:06,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:06,914 INFO L82 PathProgramCache]: Analyzing trace with hash 383595469, now seen corresponding path program 5 times [2018-09-26 08:07:06,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:06,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:06,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:06,979 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-09-26 08:07:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,053 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:07:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:07,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-09-26 08:07:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,056 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:07:07,057 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:07:07,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:07:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 08:07:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:07:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:07:07,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:07:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,063 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:07:07,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:07:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:07:07,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,064 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:07:07,065 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash -731995049, now seen corresponding path program 6 times [2018-09-26 08:07:07,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:07,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:07,113 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 08:07:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,165 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:07:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:07,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 08:07:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,167 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:07:07,168 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:07:07,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:07:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-09-26 08:07:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:07:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:07:07,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:07:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,181 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:07:07,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:07:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:07,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,182 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:07:07,184 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,185 INFO L82 PathProgramCache]: Analyzing trace with hash 927341153, now seen corresponding path program 7 times [2018-09-26 08:07:07,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:07,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:07,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:07,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:07,255 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-09-26 08:07:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,319 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:07:07,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:07:07,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:07:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,320 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:07:07,320 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:07:07,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:07:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-26 08:07:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:07:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:07:07,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:07:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,328 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:07:07,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:07:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:07:07,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,329 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:07:07,329 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2116564459, now seen corresponding path program 8 times [2018-09-26 08:07:07,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:07:07,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:07,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:07,393 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 08:07:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,485 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:07:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:07,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:07:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,487 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:07:07,487 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:07:07,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:07:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-26 08:07:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:07:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:07:07,500 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:07:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,501 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:07:07,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:07:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:07,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,505 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:07:07,506 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1796106507, now seen corresponding path program 9 times [2018-09-26 08:07:07,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:07:07,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:07:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:07:07,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:07:07,571 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-09-26 08:07:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,654 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:07:07,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:07:07,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-09-26 08:07:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,656 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:07:07,656 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:07:07,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:07:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-26 08:07:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:07:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:07:07,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:07:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,669 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:07:07,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:07:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:07:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:07:07,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,671 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:07:07,671 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 518446463, now seen corresponding path program 10 times [2018-09-26 08:07:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:07:07,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:07:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:07:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:07:07,740 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 08:07:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:07,830 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:07:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:07:07,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 08:07:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:07,831 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:07:07,831 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:07:07,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:07:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-09-26 08:07:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:07:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:07:07,846 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:07:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,846 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:07:07,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:07:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:07:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:07:07,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,848 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:07:07,848 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash 10791305, now seen corresponding path program 11 times [2018-09-26 08:07:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,912 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:07:07,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:07:07,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:07:07,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:07,915 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-09-26 08:07:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,008 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:07:08,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:08,009 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-26 08:07:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,009 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:07:08,010 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:07:08,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:07:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 08:07:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:07:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:07:08,024 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:07:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,024 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:07:08,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:07:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:07:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:07:08,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,028 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:07:08,029 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1780456211, now seen corresponding path program 12 times [2018-09-26 08:07:08,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:07:08,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:07:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:07:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:08,098 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 08:07:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,190 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:07:08,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:08,191 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 08:07:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,191 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:07:08,192 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:07:08,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:07:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:07:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-09-26 08:07:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:07:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:07:08,204 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:07:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,205 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:07:08,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:07:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:07:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:07:08,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,210 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:07:08,210 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1621381661, now seen corresponding path program 13 times [2018-09-26 08:07:08,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:07:08,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:07:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:07:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:07:08,288 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-09-26 08:07:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,371 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:07:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:08,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-09-26 08:07:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,372 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:07:08,372 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:07:08,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:07:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:07:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-26 08:07:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:07:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:07:08,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:07:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,379 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:07:08,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:07:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:07:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:07:08,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,381 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:07:08,381 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash -925405529, now seen corresponding path program 14 times [2018-09-26 08:07:08,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:07:08,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:07:08,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:07:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:08,452 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 08:07:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,547 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:07:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:08,547 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 08:07:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,548 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:07:08,548 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:07:08,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:07:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:07:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-09-26 08:07:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:07:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:07:08,556 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:07:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,556 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:07:08,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:07:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:07:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:07:08,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,557 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:07:08,558 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash -256536399, now seen corresponding path program 15 times [2018-09-26 08:07:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:07:08,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:07:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:07:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:07:08,654 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-09-26 08:07:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,763 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:07:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:08,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-09-26 08:07:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,765 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:07:08,765 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:07:08,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:07:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-26 08:07:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:07:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:07:08,776 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:07:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,776 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:07:08,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:07:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:07:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:07:08,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,778 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:07:08,778 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1718396869, now seen corresponding path program 16 times [2018-09-26 08:07:08,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:08,852 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:08,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:07:08,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:07:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:07:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:07:08,854 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 08:07:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:08,954 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:07:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:08,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 08:07:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:08,956 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:07:08,956 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:07:08,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:07:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-09-26 08:07:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:07:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:07:08,963 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:07:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:08,964 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:07:08,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:07:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:07:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:07:08,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:08,965 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:07:08,966 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:08,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2112002747, now seen corresponding path program 17 times [2018-09-26 08:07:08,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:07:09,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:07:09,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:07:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:07:09,047 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-09-26 08:07:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,152 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:07:09,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:09,152 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-09-26 08:07:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,153 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:07:09,153 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:07:09,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:07:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:07:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-26 08:07:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:07:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:07:09,160 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:07:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,161 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:07:09,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:07:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:07:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:07:09,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,162 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:07:09,162 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1884837839, now seen corresponding path program 18 times [2018-09-26 08:07:09,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:07:09,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:07:09,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:07:09,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:09,251 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-26 08:07:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,380 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:07:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:07:09,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-26 08:07:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,381 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:07:09,381 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:07:09,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=1010, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:07:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:07:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-09-26 08:07:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:07:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:07:09,390 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:07:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,390 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:07:09,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:07:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:07:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:07:09,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,392 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:07:09,392 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1147088935, now seen corresponding path program 19 times [2018-09-26 08:07:09,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:07:09,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:07:09,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:07:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:07:09,480 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-09-26 08:07:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,607 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:07:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:07:09,607 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-09-26 08:07:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,608 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:07:09,608 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:07:09,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:07:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:07:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-26 08:07:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:07:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:07:09,623 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:07:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,624 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:07:09,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:07:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:07:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:07:09,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,625 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:07:09,625 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1454075235, now seen corresponding path program 20 times [2018-09-26 08:07:09,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:07:09,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:07:09,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:07:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:09,723 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-26 08:07:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,850 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:07:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:07:09,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 08:07:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,851 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:07:09,851 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:07:09,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=759, Invalid=1221, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:07:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:07:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-09-26 08:07:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:07:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:07:09,859 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:07:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,860 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:07:09,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:07:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:07:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:07:09,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,861 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:07:09,861 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1501876333, now seen corresponding path program 21 times [2018-09-26 08:07:09,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:09,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:07:09,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:07:09,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:07:09,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:07:09,979 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2018-09-26 08:07:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,113 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:07:10,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:07:10,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-09-26 08:07:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,114 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:07:10,114 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:07:10,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:07:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:07:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-26 08:07:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:07:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:07:10,126 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:07:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,127 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:07:10,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:07:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:07:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:07:10,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,128 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:07:10,128 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 194091255, now seen corresponding path program 22 times [2018-09-26 08:07:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:10,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:10,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:07:10,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:07:10,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:07:10,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:10,296 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-26 08:07:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,427 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:07:10,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:07:10,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-26 08:07:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,428 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:07:10,428 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:07:10,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=900, Invalid=1452, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:07:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:07:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-09-26 08:07:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:07:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:07:10,441 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:07:10,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,441 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:07:10,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:07:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:07:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:07:10,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,446 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:07:10,446 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1838049025, now seen corresponding path program 23 times [2018-09-26 08:07:10,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:10,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:10,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:07:10,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:07:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:07:10,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:07:10,548 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2018-09-26 08:07:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,676 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:07:10,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:07:10,677 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-09-26 08:07:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,677 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:07:10,678 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:07:10,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:07:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:07:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 08:07:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:07:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:07:10,687 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:07:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,688 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:07:10,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:07:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:07:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:07:10,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,689 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:07:10,689 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1133501067, now seen corresponding path program 24 times [2018-09-26 08:07:10,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:10,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:10,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:07:10,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:07:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:07:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:07:10,783 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-26 08:07:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:10,938 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:07:10,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:07:10,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-26 08:07:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:10,939 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:07:10,940 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:07:10,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:07:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:07:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-09-26 08:07:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:07:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:07:10,954 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:07:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:10,956 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:07:10,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:07:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:07:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:07:10,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:10,957 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:07:10,958 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:10,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1627221099, now seen corresponding path program 25 times [2018-09-26 08:07:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:11,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:07:11,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:07:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:07:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:07:11,085 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2018-09-26 08:07:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,237 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:07:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:11,238 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-09-26 08:07:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,238 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:07:11,239 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:07:11,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:07:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:07:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-26 08:07:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:07:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:07:11,250 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:07:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,250 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:07:11,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:07:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:07:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:07:11,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,251 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:07:11,251 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -391433697, now seen corresponding path program 26 times [2018-09-26 08:07:11,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:11,358 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:07:11,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:07:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:07:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:07:11,359 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-26 08:07:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,527 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:07:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:07:11,528 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-26 08:07:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,528 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:07:11,528 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:07:11,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1218, Invalid=1974, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:07:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:07:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-09-26 08:07:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:07:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:07:11,536 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:07:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,536 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:07:11,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:07:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:07:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:07:11,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,537 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:07:11,537 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1789285929, now seen corresponding path program 27 times [2018-09-26 08:07:11,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:11,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:07:11,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:07:11,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:07:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:07:11,650 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2018-09-26 08:07:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,813 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:07:11,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:07:11,814 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-09-26 08:07:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,814 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:07:11,815 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:07:11,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:07:11,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:07:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 08:07:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:07:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:07:11,824 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:07:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:11,824 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:07:11,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:07:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:07:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:07:11,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:11,825 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:07:11,825 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:11,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1516806067, now seen corresponding path program 28 times [2018-09-26 08:07:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:11,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:11,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:07:11,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:07:11,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:07:11,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:07:11,941 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-26 08:07:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,105 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:07:12,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:07:12,105 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-26 08:07:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,106 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:07:12,106 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:07:12,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1395, Invalid=2265, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:07:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:07:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-09-26 08:07:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:07:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:07:12,115 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:07:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,115 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:07:12,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:07:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:07:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:07:12,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,116 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:07:12,117 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1656663741, now seen corresponding path program 29 times [2018-09-26 08:07:12,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:07:12,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:07:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:07:12,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:07:12,236 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-09-26 08:07:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,413 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:07:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:07:12,414 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-09-26 08:07:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,415 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:07:12,415 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:07:12,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:07:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:07:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-26 08:07:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:07:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:07:12,424 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:07:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,424 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:07:12,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:07:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:07:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:07:12,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,425 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:07:12,425 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1379065017, now seen corresponding path program 30 times [2018-09-26 08:07:12,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,553 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:07:12,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:07:12,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:07:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:07:12,555 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-26 08:07:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:12,777 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:07:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:07:12,778 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-26 08:07:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:12,778 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:07:12,779 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:07:12,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1584, Invalid=2576, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:07:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:07:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-09-26 08:07:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:07:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:07:12,789 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:07:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,790 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:07:12,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:07:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:07:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:07:12,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,791 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:07:12,791 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1863359825, now seen corresponding path program 31 times [2018-09-26 08:07:12,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:07:12,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:07:12,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:07:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:12,945 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2018-09-26 08:07:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,241 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:07:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:07:13,241 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-09-26 08:07:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,242 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:07:13,242 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:07:13,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:07:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:07:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-26 08:07:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:07:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:07:13,254 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:07:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:13,254 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:07:13,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:07:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:07:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:07:13,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:13,255 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:07:13,255 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:13,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash -312623909, now seen corresponding path program 32 times [2018-09-26 08:07:13,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:13,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:13,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:07:13,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:07:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:07:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:07:13,431 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-26 08:07:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,631 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:07:13,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:07:13,631 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-26 08:07:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,632 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:07:13,632 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:07:13,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1785, Invalid=2907, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:07:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:07:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-09-26 08:07:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:07:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:07:13,640 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:07:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:13,640 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:07:13,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:07:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:07:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:07:13,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:13,641 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:07:13,641 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:13,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash 216080869, now seen corresponding path program 33 times [2018-09-26 08:07:13,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:13,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:13,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:07:13,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:07:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:07:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:07:13,773 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2018-09-26 08:07:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,976 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:07:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:07:13,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-09-26 08:07:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,977 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:07:13,977 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:07:13,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:07:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:07:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-26 08:07:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:07:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:07:13,984 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:07:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:13,985 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:07:13,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:07:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:07:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:07:13,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:13,986 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:07:13,986 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:13,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1495231599, now seen corresponding path program 34 times [2018-09-26 08:07:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:14,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:07:14,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:07:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:07:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:07:14,150 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-26 08:07:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:14,350 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:07:14,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:07:14,350 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-26 08:07:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:14,351 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:07:14,351 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:07:14,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1998, Invalid=3258, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:07:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:07:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-09-26 08:07:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:07:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:07:14,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:07:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,359 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:07:14,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:07:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:07:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:07:14,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,360 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:07:14,360 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1896530823, now seen corresponding path program 35 times [2018-09-26 08:07:14,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:14,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:07:14,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:07:14,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:07:14,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:07:14,515 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2018-09-26 08:07:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:14,717 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:07:14,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:07:14,717 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-09-26 08:07:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:14,718 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:07:14,718 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:07:14,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:07:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:07:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-26 08:07:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:07:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:07:14,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:07:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,726 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:07:14,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:07:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:07:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:07:14,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,727 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:07:14,727 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1500040701, now seen corresponding path program 36 times [2018-09-26 08:07:14,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:14,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:07:14,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:07:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:07:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:07:14,884 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-26 08:07:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,099 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:07:15,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:07:15,099 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-26 08:07:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,100 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:07:15,100 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:07:15,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2223, Invalid=3629, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:07:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:07:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-09-26 08:07:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:07:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:07:15,108 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:07:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:15,108 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:07:15,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:07:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:07:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:07:15,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:15,109 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:07:15,109 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:15,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1569844493, now seen corresponding path program 37 times [2018-09-26 08:07:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:15,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:15,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:07:15,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:07:15,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:07:15,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:07:15,255 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2018-09-26 08:07:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,473 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:07:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:07:15,474 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-09-26 08:07:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,474 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:07:15,475 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:07:15,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:07:15,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:07:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-26 08:07:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:07:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:07:15,486 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:07:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:15,486 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:07:15,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:07:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:07:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:07:15,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:15,487 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:07:15,487 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:15,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:15,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1086983575, now seen corresponding path program 38 times [2018-09-26 08:07:15,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:15,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:15,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:07:15,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:07:15,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:07:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:07:15,630 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-26 08:07:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,883 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:07:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:07:15,884 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 08:07:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,884 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:07:15,885 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:07:15,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2460, Invalid=4020, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:07:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:07:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-09-26 08:07:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:07:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:07:15,894 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:07:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:15,895 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:07:15,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:07:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:07:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:07:15,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:15,896 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:07:15,896 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 914109345, now seen corresponding path program 39 times [2018-09-26 08:07:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:16,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:16,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:07:16,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:07:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:07:16,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:07:16,086 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-09-26 08:07:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,399 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:07:16,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:07:16,400 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-09-26 08:07:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,400 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:07:16,401 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:07:16,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:07:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:07:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-26 08:07:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:07:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:07:16,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:07:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:16,410 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:07:16,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:07:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:07:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:07:16,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:16,411 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:07:16,411 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:16,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2009268437, now seen corresponding path program 40 times [2018-09-26 08:07:16,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:16,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:16,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:07:16,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:07:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:07:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:07:16,538 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-26 08:07:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:16,731 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:07:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:07:16,731 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-26 08:07:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:16,732 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:07:16,732 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:07:16,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2709, Invalid=4431, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:07:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:07:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-09-26 08:07:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:07:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:07:16,740 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:07:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:16,741 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:07:16,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:07:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:07:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:07:16,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:16,742 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:07:16,742 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:16,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1828261941, now seen corresponding path program 41 times [2018-09-26 08:07:16,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:16,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:16,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:07:16,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:07:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:07:16,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:07:16,876 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2018-09-26 08:07:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:17,089 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:07:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:07:17,090 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-09-26 08:07:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:17,091 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:07:17,091 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:07:17,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:07:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:07:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-26 08:07:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:07:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:07:17,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:07:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,100 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:07:17,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:07:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:07:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:07:17,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,101 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:07:17,101 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash 318047935, now seen corresponding path program 42 times [2018-09-26 08:07:17,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:17,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:07:17,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:07:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:07:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:07:17,247 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-26 08:07:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:17,475 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:07:17,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:07:17,476 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-26 08:07:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:17,477 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:07:17,477 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:07:17,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2970, Invalid=4862, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:07:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:07:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-09-26 08:07:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:07:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:07:17,485 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:07:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,485 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:07:17,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:07:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:07:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:07:17,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,486 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:07:17,487 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,487 INFO L82 PathProgramCache]: Analyzing trace with hash 701334217, now seen corresponding path program 43 times [2018-09-26 08:07:17,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:17,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:07:17,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:07:17,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:07:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:07:17,642 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2018-09-26 08:07:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:17,885 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:07:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:07:17,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-09-26 08:07:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:17,887 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:07:17,887 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:07:17,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:07:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:07:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-26 08:07:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:07:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:07:17,895 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:07:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,895 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:07:17,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:07:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:07:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:07:17,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,896 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:07:17,897 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash -327736237, now seen corresponding path program 44 times [2018-09-26 08:07:17,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:18,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:18,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:07:18,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:07:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:07:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:07:18,053 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-26 08:07:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,301 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:07:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:07:18,302 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-26 08:07:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,303 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:07:18,303 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:07:18,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3243, Invalid=5313, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:07:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:07:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-09-26 08:07:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:07:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:07:18,311 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:07:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:18,311 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:07:18,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:07:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:07:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:07:18,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:18,312 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:07:18,313 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:18,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:18,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1421964451, now seen corresponding path program 45 times [2018-09-26 08:07:18,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:18,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:18,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:07:18,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:07:18,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:07:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:07:18,464 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2018-09-26 08:07:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,733 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:07:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:07:18,733 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-09-26 08:07:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,734 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:07:18,734 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:07:18,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:07:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:07:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-26 08:07:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:07:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:07:18,742 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:07:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:18,743 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:07:18,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:07:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:07:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:07:18,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:18,744 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:07:18,744 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:18,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -708290585, now seen corresponding path program 46 times [2018-09-26 08:07:18,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:18,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:18,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:07:18,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:07:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:07:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:07:18,934 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-26 08:07:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:19,249 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:07:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:07:19,249 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 08:07:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:19,250 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:07:19,251 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:07:19,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3528, Invalid=5784, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:07:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:07:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-09-26 08:07:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:07:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:07:19,260 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:07:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,261 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:07:19,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:07:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:07:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:07:19,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,262 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:07:19,262 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2062472719, now seen corresponding path program 47 times [2018-09-26 08:07:19,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:19,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:07:19,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:07:19,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:07:19,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:07:19,455 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2018-09-26 08:07:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:19,674 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:07:19,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:07:19,675 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-09-26 08:07:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:19,676 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:07:19,676 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:07:19,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:07:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:07:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-26 08:07:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:07:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:07:19,684 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:07:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,685 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:07:19,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:07:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:07:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:07:19,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,686 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:07:19,686 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2056412805, now seen corresponding path program 48 times [2018-09-26 08:07:19,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:19,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:07:19,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:07:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:07:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:07:19,829 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-26 08:07:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,057 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:07:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:07:20,057 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-26 08:07:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,058 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:07:20,058 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:07:20,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3825, Invalid=6275, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:07:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:07:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-09-26 08:07:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:07:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:07:20,067 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:07:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:20,067 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:07:20,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:07:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:07:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:07:20,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:20,069 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:07:20,069 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:20,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:20,069 INFO L82 PathProgramCache]: Analyzing trace with hash -527802747, now seen corresponding path program 49 times [2018-09-26 08:07:20,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:20,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:20,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:07:20,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:07:20,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:07:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:07:20,224 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2018-09-26 08:07:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,481 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:07:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:07:20,481 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-09-26 08:07:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,482 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:07:20,482 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:07:20,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:07:20,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:07:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-26 08:07:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:07:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:07:20,491 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:07:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:20,491 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:07:20,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:07:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:07:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:07:20,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:20,492 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:07:20,492 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:20,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash -412352241, now seen corresponding path program 50 times [2018-09-26 08:07:20,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:20,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:20,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:07:20,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:07:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:07:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:07:20,658 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-26 08:07:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,935 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:07:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:07:20,936 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-26 08:07:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,936 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:07:20,937 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:07:20,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4134, Invalid=6786, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:07:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:07:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-09-26 08:07:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:07:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:07:20,956 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:07:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:20,957 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:07:20,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:07:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:07:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:07:20,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:20,958 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:07:20,958 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:20,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1133565671, now seen corresponding path program 51 times [2018-09-26 08:07:20,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:21,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:21,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:07:21,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:07:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:07:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:07:21,143 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2018-09-26 08:07:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:21,427 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:07:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:07:21,427 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-09-26 08:07:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:21,428 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:07:21,428 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:07:21,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:07:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:07:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-26 08:07:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:07:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:07:21,438 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:07:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,439 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:07:21,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:07:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:07:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:07:21,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,443 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:07:21,443 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1565030051, now seen corresponding path program 52 times [2018-09-26 08:07:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:21,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:21,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:07:21,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:07:21,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:07:21,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:07:21,631 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-26 08:07:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:21,970 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:07:21,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:07:21,970 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-26 08:07:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:21,971 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:07:21,971 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:07:21,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4455, Invalid=7317, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:07:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:07:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-09-26 08:07:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:07:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:07:21,980 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:07:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,980 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:07:21,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:07:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:07:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:07:21,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,982 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:07:21,982 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash 755272109, now seen corresponding path program 53 times [2018-09-26 08:07:21,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:22,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:07:22,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:07:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:07:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:07:22,157 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2018-09-26 08:07:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:22,441 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:07:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:07:22,442 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-09-26 08:07:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:22,443 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:07:22,443 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:07:22,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:07:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:07:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-26 08:07:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:07:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:07:22,452 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:07:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,452 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:07:22,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:07:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:07:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:07:22,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,454 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:07:22,454 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash -33029577, now seen corresponding path program 54 times [2018-09-26 08:07:22,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:22,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:22,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:07:22,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:07:22,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:07:22,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:07:22,639 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-26 08:07:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:22,940 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:07:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:07:22,940 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-26 08:07:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:22,941 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:07:22,941 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:07:22,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4788, Invalid=7868, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:07:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:07:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-09-26 08:07:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:07:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:07:22,952 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:07:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:22,952 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:07:22,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:07:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:07:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:07:22,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:22,953 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:07:22,954 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:22,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1676705727, now seen corresponding path program 55 times [2018-09-26 08:07:22,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:23,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:23,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:07:23,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:07:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:07:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:07:23,128 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2018-09-26 08:07:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,407 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:07:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:07:23,408 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-09-26 08:07:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,408 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:07:23,409 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:07:23,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4959, Invalid=8151, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:07:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:07:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-26 08:07:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:07:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:07:23,417 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:07:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:23,417 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:07:23,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:07:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:07:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:07:23,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:23,419 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:07:23,419 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:23,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash -701520949, now seen corresponding path program 56 times [2018-09-26 08:07:23,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:23,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:23,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:07:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:07:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:07:23,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:07:23,607 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-26 08:07:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:23,910 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:07:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:07:23,911 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-26 08:07:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:23,912 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:07:23,912 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:07:23,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5133, Invalid=8439, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:07:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:07:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-09-26 08:07:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:07:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:07:23,920 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:07:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:23,921 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:07:23,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:07:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:07:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:07:23,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:23,922 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:07:23,922 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:23,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 148180181, now seen corresponding path program 57 times [2018-09-26 08:07:23,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:07:24,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:07:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:07:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:07:24,101 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2018-09-26 08:07:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:24,469 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:07:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:07:24,469 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-09-26 08:07:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:24,470 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:07:24,470 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:07:24,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5310, Invalid=8732, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:07:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:07:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-26 08:07:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:07:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:07:24,480 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:07:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:24,480 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:07:24,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:07:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:07:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:07:24,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:24,482 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:07:24,482 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:24,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 667179871, now seen corresponding path program 58 times [2018-09-26 08:07:24,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:24,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:24,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:07:24,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:07:24,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:07:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:07:24,737 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-26 08:07:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:25,081 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:07:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:07:25,081 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-26 08:07:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:25,082 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:07:25,082 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:07:25,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5490, Invalid=9030, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:07:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:07:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-09-26 08:07:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:07:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:07:25,089 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:07:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:25,090 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:07:25,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:07:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:07:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:07:25,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:25,092 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:07:25,092 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:25,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1209675625, now seen corresponding path program 59 times [2018-09-26 08:07:25,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:25,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:25,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:07:25,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:07:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:07:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:07:25,263 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2018-09-26 08:07:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:25,553 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:07:25,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:07:25,553 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-09-26 08:07:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:25,554 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:07:25,554 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:07:25,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5673, Invalid=9333, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:07:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:07:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-26 08:07:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:07:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:07:25,562 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:07:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:25,562 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:07:25,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:07:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:07:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:07:25,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:25,564 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:07:25,564 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:25,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1437914893, now seen corresponding path program 60 times [2018-09-26 08:07:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:25,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:25,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:07:25,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:07:25,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:07:25,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:07:25,742 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-26 08:07:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,036 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:07:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:07:26,036 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-26 08:07:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,037 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:07:26,037 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:07:26,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5859, Invalid=9641, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:07:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:07:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-09-26 08:07:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:07:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:07:26,049 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:07:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:26,050 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:07:26,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:07:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:07:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:07:26,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:26,051 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:07:26,051 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:26,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1143203837, now seen corresponding path program 61 times [2018-09-26 08:07:26,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:26,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:26,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:07:26,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:07:26,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:07:26,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:07:26,248 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2018-09-26 08:07:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:26,594 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:07:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:07:26,595 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-09-26 08:07:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:26,596 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:07:26,596 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:07:26,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6048, Invalid=9954, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:07:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:07:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-26 08:07:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:07:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:07:26,606 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:07:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:26,606 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:07:26,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:07:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:07:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:07:26,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:26,608 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:07:26,608 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:26,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash -892793721, now seen corresponding path program 62 times [2018-09-26 08:07:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:26,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:26,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:07:26,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:07:26,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:07:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:07:26,831 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-26 08:07:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:27,193 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:07:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:07:27,193 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-26 08:07:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:27,194 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:07:27,194 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:07:27,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6240, Invalid=10272, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:07:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:07:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-09-26 08:07:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:07:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:07:27,203 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:07:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,204 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:07:27,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:07:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:07:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:07:27,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,205 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:07:27,205 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1018640017, now seen corresponding path program 63 times [2018-09-26 08:07:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:27,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:27,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:07:27,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:07:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:07:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:07:27,481 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2018-09-26 08:07:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:27,807 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:07:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:07:27,808 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-09-26 08:07:27,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:27,811 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:07:27,811 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:07:27,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6435, Invalid=10595, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:07:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:07:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-26 08:07:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:07:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:07:27,822 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:07:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:27,822 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:07:27,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:07:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:07:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:07:27,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:27,826 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:07:27,826 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:27,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:27,826 INFO L82 PathProgramCache]: Analyzing trace with hash -339540453, now seen corresponding path program 64 times [2018-09-26 08:07:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:28,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:28,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:07:28,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:07:28,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:07:28,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:07:28,029 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-26 08:07:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,374 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:07:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:07:28,374 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-26 08:07:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,375 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:07:28,375 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:07:28,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6633, Invalid=10923, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:07:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:07:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-09-26 08:07:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:07:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:07:28,384 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:07:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:28,385 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:07:28,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:07:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:07:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:07:28,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:28,386 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:07:28,386 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 119085861, now seen corresponding path program 65 times [2018-09-26 08:07:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:28,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:28,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:07:28,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:07:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:07:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:07:28,613 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2018-09-26 08:07:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:28,988 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:07:28,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:07:28,988 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-09-26 08:07:28,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:28,989 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:07:28,990 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:07:28,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6834, Invalid=11256, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:07:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:07:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-26 08:07:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:07:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:07:29,000 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:07:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,001 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:07:29,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:07:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:07:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:07:29,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,002 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:07:29,002 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1522657873, now seen corresponding path program 66 times [2018-09-26 08:07:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:29,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:29,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:07:29,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:07:29,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:07:29,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:07:29,185 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-26 08:07:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:29,529 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:07:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:07:29,529 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-26 08:07:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:29,530 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:07:29,530 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:07:29,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7038, Invalid=11594, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:07:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:07:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-09-26 08:07:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:07:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:07:29,540 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:07:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:29,541 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:07:29,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:07:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:07:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:07:29,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:29,542 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:07:29,542 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:29,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1309578681, now seen corresponding path program 67 times [2018-09-26 08:07:29,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:29,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:29,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:07:29,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:07:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:07:29,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:07:29,756 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2018-09-26 08:07:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:30,143 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:07:30,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:07:30,144 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-09-26 08:07:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:30,145 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:07:30,145 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:07:30,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7245, Invalid=11937, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:07:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:07:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-26 08:07:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:07:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:07:30,155 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:07:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:30,155 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:07:30,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:07:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:07:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:07:30,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:30,156 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:07:30,157 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:30,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 79641411, now seen corresponding path program 68 times [2018-09-26 08:07:30,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:30,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:30,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:07:30,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:07:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:07:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:07:30,478 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-26 08:07:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:30,875 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:07:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:07:30,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-26 08:07:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:30,877 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:07:30,877 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:07:30,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7455, Invalid=12285, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:07:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:07:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-09-26 08:07:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:07:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:07:30,886 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:07:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:30,886 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:07:30,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:07:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:07:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:07:30,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:30,887 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:07:30,888 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:30,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash -774068659, now seen corresponding path program 69 times [2018-09-26 08:07:30,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:31,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:31,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:07:31,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:07:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:07:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:07:31,119 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2018-09-26 08:07:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:31,475 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:07:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:07:31,475 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-09-26 08:07:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:31,476 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:07:31,476 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:07:31,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7668, Invalid=12638, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:07:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:07:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-26 08:07:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:07:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:07:31,484 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:07:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:31,484 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:07:31,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:07:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:07:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:07:31,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:31,485 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:07:31,485 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:31,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash -850692393, now seen corresponding path program 70 times [2018-09-26 08:07:31,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:31,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:31,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:07:31,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:07:31,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:07:31,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:07:31,688 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-26 08:07:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:31,957 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:07:31,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:07:31,958 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-26 08:07:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:31,959 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:07:31,959 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:07:31,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7884, Invalid=12996, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:07:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:07:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-09-26 08:07:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:07:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:07:31,966 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:07:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:31,966 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:07:31,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:07:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:07:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:07:31,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:31,968 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:07:31,968 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:31,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1471656735, now seen corresponding path program 71 times [2018-09-26 08:07:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:32,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:32,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:07:32,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:07:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:07:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:07:32,205 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2018-09-26 08:07:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:32,544 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:07:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:07:32,544 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-09-26 08:07:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:32,545 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:07:32,545 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:07:32,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8103, Invalid=13359, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:07:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:07:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-26 08:07:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:07:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:07:32,555 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:07:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:32,556 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:07:32,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:07:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:07:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:07:32,556 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:32,557 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:07:32,557 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:32,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1217935253, now seen corresponding path program 72 times [2018-09-26 08:07:32,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:32,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:32,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:07:32,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:07:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:07:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:07:32,745 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-26 08:07:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:33,074 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:07:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:07:33,075 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-26 08:07:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:33,076 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:07:33,076 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:07:33,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8325, Invalid=13727, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:07:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:07:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-09-26 08:07:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:07:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:07:33,085 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:07:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,085 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:07:33,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:07:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:07:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:07:33,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,087 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:07:33,087 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2090240373, now seen corresponding path program 73 times [2018-09-26 08:07:33,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:33,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:33,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:07:33,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:07:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:07:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:07:33,328 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2018-09-26 08:07:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:33,640 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:07:33,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:07:33,640 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-09-26 08:07:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:33,641 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:07:33,642 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:07:33,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8550, Invalid=14100, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:07:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:07:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-26 08:07:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:07:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:07:33,650 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:07:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,651 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:07:33,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:07:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:07:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:07:33,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,652 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:07:33,652 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1323749377, now seen corresponding path program 74 times [2018-09-26 08:07:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:33,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:33,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:07:33,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:07:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:07:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:07:33,818 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-26 08:07:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:34,109 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:07:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:07:34,110 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-26 08:07:34,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:34,111 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:07:34,111 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:07:34,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=14478, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:07:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:07:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-09-26 08:07:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:07:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:07:34,120 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:07:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:34,121 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:07:34,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:07:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:07:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:07:34,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:34,122 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:07:34,122 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:34,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash -812884983, now seen corresponding path program 75 times [2018-09-26 08:07:34,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:34,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:34,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:07:34,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:07:34,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:07:34,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:07:34,311 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2018-09-26 08:07:34,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:34,633 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:07:34,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:07:34,633 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-09-26 08:07:34,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:34,634 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:07:34,635 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:07:34,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9009, Invalid=14861, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:07:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:07:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-26 08:07:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:07:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:07:34,645 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:07:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:34,645 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:07:34,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:07:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:07:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:07:34,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:34,646 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:07:34,647 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:34,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:34,647 INFO L82 PathProgramCache]: Analyzing trace with hash 501525907, now seen corresponding path program 76 times [2018-09-26 08:07:34,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:34,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:34,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:07:34,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:07:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:07:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:07:34,853 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-26 08:07:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:35,191 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:07:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:07:35,191 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-26 08:07:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:35,192 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:07:35,192 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:07:35,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9243, Invalid=15249, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:07:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:07:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-09-26 08:07:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:07:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:07:35,203 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:07:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:35,204 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:07:35,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:07:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:07:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:07:35,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:35,205 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:07:35,205 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:35,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:35,206 INFO L82 PathProgramCache]: Analyzing trace with hash 930006173, now seen corresponding path program 77 times [2018-09-26 08:07:35,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:35,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:35,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:07:35,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:07:35,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:07:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:07:35,407 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2018-09-26 08:07:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:35,850 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:07:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:07:35,850 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2018-09-26 08:07:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:35,851 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:07:35,852 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:07:35,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9480, Invalid=15642, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:07:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:07:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 08:07:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:07:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:07:35,864 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:07:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:35,865 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:07:35,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:07:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:07:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:07:35,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:35,866 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:07:35,866 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:35,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash 382681383, now seen corresponding path program 78 times [2018-09-26 08:07:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:36,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:07:36,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:07:36,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:07:36,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:07:36,172 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-26 08:07:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:36,478 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:07:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:07:36,478 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-26 08:07:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:36,479 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:07:36,479 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:07:36,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9720, Invalid=16040, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:07:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:07:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-09-26 08:07:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:07:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:07:36,489 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-09-26 08:07:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:07:36,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:07:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:07:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:07:36,490 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:36,491 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-09-26 08:07:36,491 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:36,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1610431695, now seen corresponding path program 79 times [2018-09-26 08:07:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:36,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:36,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:07:36,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:07:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:07:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:07:36,690 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2018-09-26 08:07:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:37,059 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:07:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:07:37,059 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2018-09-26 08:07:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:37,060 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:07:37,060 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:07:37,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9963, Invalid=16443, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:07:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:07:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-26 08:07:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:07:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:07:37,071 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-09-26 08:07:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:37,072 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:07:37,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:07:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:07:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:07:37,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:37,073 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-09-26 08:07:37,073 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:37,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1436685637, now seen corresponding path program 80 times [2018-09-26 08:07:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:37,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:37,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:07:37,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:07:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:07:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:07:37,392 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-26 08:07:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:37,754 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:07:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:07:37,755 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-26 08:07:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:37,756 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:07:37,756 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:07:37,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10209, Invalid=16851, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:07:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:07:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-09-26 08:07:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:07:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:07:37,764 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-09-26 08:07:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:37,764 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:07:37,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:07:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:07:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:07:37,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:37,766 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-09-26 08:07:37,766 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:37,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1970448443, now seen corresponding path program 81 times [2018-09-26 08:07:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:37,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:37,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:07:37,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:07:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:07:37,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:07:37,983 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2018-09-26 08:07:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:38,386 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:07:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:07:38,387 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2018-09-26 08:07:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:38,387 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:07:38,388 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:07:38,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10458, Invalid=17264, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:07:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:07:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-26 08:07:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:07:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:07:38,398 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-09-26 08:07:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:38,399 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:07:38,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:07:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:07:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:07:38,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:38,400 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-09-26 08:07:38,400 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:38,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash 479570511, now seen corresponding path program 82 times [2018-09-26 08:07:38,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:38,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:38,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:07:38,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:07:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:07:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:07:38,627 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-26 08:07:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:39,000 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:07:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:07:39,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-26 08:07:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:39,001 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:07:39,001 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:07:39,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10710, Invalid=17682, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:07:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:07:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-09-26 08:07:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:07:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:07:39,011 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-09-26 08:07:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:07:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:07:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:07:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:07:39,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:39,013 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-09-26 08:07:39,013 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:39,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1305707097, now seen corresponding path program 83 times [2018-09-26 08:07:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:39,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:07:39,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:07:39,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:07:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:07:39,236 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2018-09-26 08:07:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:39,586 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:07:39,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:07:39,586 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2018-09-26 08:07:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:39,587 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:07:39,587 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:07:39,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10965, Invalid=18105, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:07:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:07:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 08:07:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:07:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:07:39,594 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-09-26 08:07:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:39,595 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:07:39,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:07:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:07:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:07:39,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:39,596 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-09-26 08:07:39,596 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:39,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 654016483, now seen corresponding path program 84 times [2018-09-26 08:07:39,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:39,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:39,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:07:39,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:07:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:07:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:07:39,816 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-26 08:07:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:40,404 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:07:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:07:40,404 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-26 08:07:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:40,405 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:07:40,405 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:07:40,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3654 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11223, Invalid=18533, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:07:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:07:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-09-26 08:07:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:07:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:07:40,417 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-09-26 08:07:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:40,418 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:07:40,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:07:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:07:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:07:40,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:40,419 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-09-26 08:07:40,419 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:40,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1444561645, now seen corresponding path program 85 times [2018-09-26 08:07:40,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:40,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:40,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:07:40,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:07:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:07:40,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:07:40,776 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2018-09-26 08:07:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:41,328 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:07:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:07:41,329 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2018-09-26 08:07:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:41,330 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:07:41,330 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:07:41,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11484, Invalid=18966, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:07:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:07:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-26 08:07:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:07:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:07:41,340 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-09-26 08:07:41,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:41,341 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:07:41,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:07:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:07:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:07:41,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:41,342 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-09-26 08:07:41,342 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:41,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash 949250935, now seen corresponding path program 86 times [2018-09-26 08:07:41,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:41,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:41,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:07:41,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:07:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:07:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:07:41,602 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-26 08:07:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:42,199 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:07:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:07:42,199 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-26 08:07:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:42,200 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:07:42,200 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:07:42,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3827 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11748, Invalid=19404, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:07:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:07:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-09-26 08:07:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:07:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:07:42,212 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-09-26 08:07:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:42,213 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:07:42,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:07:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:07:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:07:42,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:42,214 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-09-26 08:07:42,215 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:42,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1697028481, now seen corresponding path program 87 times [2018-09-26 08:07:42,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:42,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:42,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:07:42,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:07:42,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:07:42,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:07:42,608 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 91 states. [2018-09-26 08:07:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:42,995 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:07:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:07:42,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2018-09-26 08:07:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:42,996 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:07:42,996 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:07:42,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12015, Invalid=19847, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:07:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:07:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-26 08:07:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:07:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:07:43,007 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-09-26 08:07:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:43,008 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:07:43,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:07:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:07:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:07:43,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:43,009 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-09-26 08:07:43,009 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:43,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1243255541, now seen corresponding path program 88 times [2018-09-26 08:07:43,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:43,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:43,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:07:43,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:07:43,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:07:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:07:43,394 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-26 08:07:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:43,936 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:07:43,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:07:43,936 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-26 08:07:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:43,937 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:07:43,937 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:07:43,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12285, Invalid=20295, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:07:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:07:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-09-26 08:07:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:07:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:07:43,948 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-09-26 08:07:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:43,949 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:07:43,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:07:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:07:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:07:43,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:43,950 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-09-26 08:07:43,950 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:43,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -767719915, now seen corresponding path program 89 times [2018-09-26 08:07:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:44,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:44,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:07:44,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:07:44,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:07:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:07:44,244 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 93 states. [2018-09-26 08:07:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:44,698 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:07:44,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:07:44,698 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2018-09-26 08:07:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:44,699 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:07:44,699 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:07:44,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12558, Invalid=20748, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:07:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:07:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-26 08:07:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:07:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:07:44,707 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-09-26 08:07:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:44,707 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:07:44,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:07:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:07:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:07:44,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:44,709 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-09-26 08:07:44,709 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:44,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 955483295, now seen corresponding path program 90 times [2018-09-26 08:07:44,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:44,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:44,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:07:44,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:07:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:07:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:07:44,969 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-26 08:07:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:45,423 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:07:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:07:45,423 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-26 08:07:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:45,424 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:07:45,424 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:07:45,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12834, Invalid=21206, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:07:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:07:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-09-26 08:07:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:07:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:07:45,433 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-09-26 08:07:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:45,433 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:07:45,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:07:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:07:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:07:45,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:45,435 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-09-26 08:07:45,435 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:45,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -903608151, now seen corresponding path program 91 times [2018-09-26 08:07:45,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:45,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:45,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:07:45,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:07:45,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:07:45,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:07:45,747 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 95 states. [2018-09-26 08:07:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:46,372 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:07:46,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:07:46,372 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2018-09-26 08:07:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:46,373 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:07:46,373 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:07:46,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13113, Invalid=21669, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:07:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:07:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-26 08:07:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:07:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:07:46,383 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-09-26 08:07:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:07:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:07:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:07:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:07:46,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:46,384 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-09-26 08:07:46,384 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:46,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:46,384 INFO L82 PathProgramCache]: Analyzing trace with hash -784092621, now seen corresponding path program 92 times [2018-09-26 08:07:46,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:46,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:46,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:07:46,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:07:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:07:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:07:46,641 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-26 08:07:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:47,090 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:07:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:07:47,090 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-26 08:07:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:47,091 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:07:47,091 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:07:47,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13395, Invalid=22137, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:07:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:07:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-09-26 08:07:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:07:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:07:47,102 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-09-26 08:07:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:47,103 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:07:47,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:07:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:07:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:07:47,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:47,104 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-09-26 08:07:47,104 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:47,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1893785283, now seen corresponding path program 93 times [2018-09-26 08:07:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:47,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:47,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:07:47,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:07:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:07:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:07:47,376 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 97 states. [2018-09-26 08:07:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:47,902 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:07:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:07:47,902 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2018-09-26 08:07:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:47,903 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:07:47,903 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:07:47,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13680, Invalid=22610, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:07:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:07:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-26 08:07:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:07:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:07:47,911 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-09-26 08:07:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:47,911 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:07:47,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:07:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:07:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:07:47,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:47,912 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-09-26 08:07:47,912 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:47,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1138423239, now seen corresponding path program 94 times [2018-09-26 08:07:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:48,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:48,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:07:48,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:07:48,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:07:48,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:07:48,194 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-26 08:07:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:48,705 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:07:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:07:48,705 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-26 08:07:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:48,706 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:07:48,706 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:07:48,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4559 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13968, Invalid=23088, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:07:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:07:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-09-26 08:07:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:07:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:07:48,715 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-09-26 08:07:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:48,715 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:07:48,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:07:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:07:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:07:48,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:48,716 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-09-26 08:07:48,716 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:48,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:48,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1191981103, now seen corresponding path program 95 times [2018-09-26 08:07:48,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:49,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:49,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:07:49,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:07:49,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:07:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:07:49,146 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 99 states. [2018-09-26 08:07:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:49,631 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:07:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:07:49,631 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2018-09-26 08:07:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:49,632 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:07:49,632 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:07:49,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14259, Invalid=23571, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:07:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:07:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-26 08:07:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:07:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:07:49,643 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-09-26 08:07:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:49,643 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:07:49,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:07:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:07:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:07:49,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:49,645 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-09-26 08:07:49,645 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:49,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1262374747, now seen corresponding path program 96 times [2018-09-26 08:07:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:49,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:49,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:07:49,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:07:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:07:49,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:07:49,925 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-26 08:07:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:50,343 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:07:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:07:50,344 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-26 08:07:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:50,345 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:07:50,345 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:07:50,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14553, Invalid=24059, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:07:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:07:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-09-26 08:07:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:07:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:07:50,353 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-09-26 08:07:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:50,353 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:07:50,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:07:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:07:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:07:50,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:50,354 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-09-26 08:07:50,354 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:50,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1961301093, now seen corresponding path program 97 times [2018-09-26 08:07:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:50,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:50,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:07:50,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:07:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:07:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:07:50,606 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 101 states. [2018-09-26 08:07:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:51,048 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:07:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:07:51,048 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2018-09-26 08:07:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:51,049 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:07:51,049 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:07:51,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14850, Invalid=24552, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:07:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:07:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-26 08:07:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:07:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:07:51,056 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-09-26 08:07:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:51,056 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:07:51,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:07:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:07:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:07:51,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:51,057 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-09-26 08:07:51,057 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:51,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash -680345873, now seen corresponding path program 98 times [2018-09-26 08:07:51,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:51,332 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:51,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:07:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:07:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:07:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:07:51,335 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-26 08:07:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:51,805 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:07:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:07:51,805 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-26 08:07:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:51,806 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:07:51,806 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:07:51,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15150, Invalid=25050, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:07:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:07:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-09-26 08:07:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:07:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:07:51,817 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-09-26 08:07:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:51,818 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:07:51,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:07:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:07:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:07:51,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:51,819 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-09-26 08:07:51,819 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:51,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash -977408263, now seen corresponding path program 99 times [2018-09-26 08:07:51,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:52,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:52,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:07:52,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:07:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:07:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:07:52,135 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 103 states. [2018-09-26 08:07:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:52,552 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-09-26 08:07:52,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:07:52,552 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2018-09-26 08:07:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:52,553 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:07:52,553 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:07:52,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15453, Invalid=25553, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:07:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:07:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-26 08:07:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:07:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:07:52,561 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-09-26 08:07:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:52,561 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:07:52,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:07:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:07:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:07:52,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:52,562 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-09-26 08:07:52,562 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:52,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1308443779, now seen corresponding path program 100 times [2018-09-26 08:07:52,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:52,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:52,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:07:52,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:07:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:07:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:07:52,994 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-26 08:07:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:53,571 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:07:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:07:53,571 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-26 08:07:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:53,572 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:07:53,572 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:07:53,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15759, Invalid=26061, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:07:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:07:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-09-26 08:07:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:07:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:07:53,582 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-09-26 08:07:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:53,583 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:07:53,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:07:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:07:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:07:53,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:53,584 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-09-26 08:07:53,584 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:53,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1010999411, now seen corresponding path program 101 times [2018-09-26 08:07:53,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:53,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:53,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:07:53,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:07:53,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:07:53,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5358, Invalid=5562, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:07:53,902 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 105 states. [2018-09-26 08:07:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:54,484 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:07:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:07:54,484 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2018-09-26 08:07:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:54,485 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:07:54,485 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:07:54,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16068, Invalid=26574, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:07:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:07:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-26 08:07:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:07:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:07:54,495 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-09-26 08:07:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:54,495 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:07:54,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:07:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:07:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:07:54,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:54,496 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-09-26 08:07:54,496 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:54,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:54,496 INFO L82 PathProgramCache]: Analyzing trace with hash -907878377, now seen corresponding path program 102 times [2018-09-26 08:07:54,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:54,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:54,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:07:54,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:07:54,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:07:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:07:54,822 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-26 08:07:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:55,447 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-09-26 08:07:55,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:07:55,447 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-26 08:07:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:55,448 INFO L225 Difference]: With dead ends: 214 [2018-09-26 08:07:55,448 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:07:55,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16380, Invalid=27092, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:07:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:07:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-09-26 08:07:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:07:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:07:55,459 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-09-26 08:07:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:55,459 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:07:55,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:07:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:07:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:07:55,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:55,461 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-09-26 08:07:55,461 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:55,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash -592812511, now seen corresponding path program 103 times [2018-09-26 08:07:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:56,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:56,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:07:56,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:07:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:07:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5567, Invalid=5775, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:07:56,031 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 107 states. [2018-09-26 08:07:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:56,740 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:07:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:07:56,740 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2018-09-26 08:07:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:56,741 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:07:56,741 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:07:56,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16695, Invalid=27615, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:07:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:07:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-26 08:07:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:07:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 08:07:56,752 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-09-26 08:07:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:56,752 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 08:07:56,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:07:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 08:07:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:07:56,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:56,754 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-09-26 08:07:56,754 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:56,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1537773995, now seen corresponding path program 104 times [2018-09-26 08:07:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:57,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:57,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:07:57,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:07:57,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:07:57,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:07:57,098 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-26 08:07:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:57,685 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:07:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:07:57,685 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-26 08:07:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:57,686 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:07:57,686 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:07:57,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5564 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17013, Invalid=28143, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:07:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:07:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-09-26 08:07:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:07:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:07:57,697 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-09-26 08:07:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:57,697 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:07:57,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:07:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:07:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:07:57,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:57,699 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-09-26 08:07:57,699 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:57,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 332006069, now seen corresponding path program 105 times [2018-09-26 08:07:57,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:58,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:58,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:07:58,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:07:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:07:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5780, Invalid=5992, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:07:58,063 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 109 states. [2018-09-26 08:07:58,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:58,673 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:07:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:07:58,673 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2018-09-26 08:07:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:58,674 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:07:58,674 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:07:58,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17334, Invalid=28676, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:07:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:07:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-26 08:07:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:07:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 08:07:58,686 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-09-26 08:07:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:58,686 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 08:07:58,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:07:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 08:07:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:07:58,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:58,687 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-09-26 08:07:58,688 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:58,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1230199103, now seen corresponding path program 106 times [2018-09-26 08:07:58,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:59,032 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:59,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:07:59,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:07:59,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:07:59,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:07:59,034 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-26 08:07:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:59,679 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:07:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:07:59,679 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-26 08:07:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:59,680 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:07:59,680 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:07:59,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5777 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17658, Invalid=29214, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:07:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:07:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-09-26 08:07:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:07:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-09-26 08:07:59,689 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-09-26 08:07:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:59,689 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-09-26 08:07:59,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:07:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-09-26 08:07:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:07:59,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:59,690 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-09-26 08:07:59,690 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:59,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1105278281, now seen corresponding path program 107 times [2018-09-26 08:07:59,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:00,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:00,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:08:00,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:08:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:08:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5997, Invalid=6213, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:08:00,046 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 111 states. [2018-09-26 08:08:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:00,623 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:08:00,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:08:00,623 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2018-09-26 08:08:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:00,624 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:08:00,624 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:08:00,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17985, Invalid=29757, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:08:00,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:08:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-26 08:08:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:08:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:08:00,634 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-09-26 08:08:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:00,634 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:08:00,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:08:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:08:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:08:00,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:00,635 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-09-26 08:08:00,635 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:00,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1315452627, now seen corresponding path program 108 times [2018-09-26 08:08:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:00,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:00,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:08:00,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:08:00,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:08:00,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6107, Invalid=6325, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:08:00,997 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-26 08:08:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:01,618 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 08:08:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:08:01,618 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-26 08:08:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:01,619 INFO L225 Difference]: With dead ends: 226 [2018-09-26 08:08:01,619 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:08:01,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5994 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18315, Invalid=30305, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:08:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:08:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-09-26 08:08:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:08:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-09-26 08:08:01,631 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-09-26 08:08:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:01,631 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-09-26 08:08:01,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:08:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-09-26 08:08:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:08:01,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:01,633 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-09-26 08:08:01,633 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:01,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1429536221, now seen corresponding path program 109 times [2018-09-26 08:08:01,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:01,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:01,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:08:01,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:08:01,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:08:01,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6218, Invalid=6438, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:08:01,972 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 113 states. [2018-09-26 08:08:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:02,572 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:08:02,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:08:02,572 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2018-09-26 08:08:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:02,573 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:08:02,573 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:08:02,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18648, Invalid=30858, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:08:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:08:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-26 08:08:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:08:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 08:08:02,581 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-09-26 08:08:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:02,582 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 08:08:02,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:08:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 08:08:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:08:02,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:02,582 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-09-26 08:08:02,583 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:02,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash -605279641, now seen corresponding path program 110 times [2018-09-26 08:08:02,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:02,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:02,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:08:02,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:08:02,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:08:02,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:08:02,899 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-26 08:08:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:03,517 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:08:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:08:03,517 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-26 08:08:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:03,518 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:08:03,518 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:08:03,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18984, Invalid=31416, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:08:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:08:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2018-09-26 08:08:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:08:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:08:03,528 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-09-26 08:08:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:03,528 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:08:03,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:08:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:08:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:08:03,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:03,529 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-09-26 08:08:03,529 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:03,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1853203343, now seen corresponding path program 111 times [2018-09-26 08:08:03,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:03,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:03,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:08:03,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:08:03,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:08:03,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6443, Invalid=6667, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:08:03,931 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 115 states. [2018-09-26 08:08:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:04,526 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-09-26 08:08:04,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:08:04,526 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2018-09-26 08:08:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:04,527 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:08:04,527 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:08:04,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19323, Invalid=31979, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:08:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:08:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-26 08:08:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:08:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 08:08:04,536 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-09-26 08:08:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:04,536 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 08:08:04,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:08:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 08:08:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:08:04,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:04,537 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-09-26 08:08:04,538 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:04,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1482961915, now seen corresponding path program 112 times [2018-09-26 08:08:04,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:04,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:04,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:08:04,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:08:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:08:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:08:04,913 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-26 08:08:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:05,577 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:08:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:08:05,578 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-26 08:08:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:05,578 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:08:05,578 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:08:05,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19665, Invalid=32547, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:08:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:08:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-09-26 08:08:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:08:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:08:05,591 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-09-26 08:08:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:05,591 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:08:05,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:08:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:08:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:08:05,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:05,592 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-09-26 08:08:05,592 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:05,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash -802795259, now seen corresponding path program 113 times [2018-09-26 08:08:05,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:05,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:05,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:08:05,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:08:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:08:05,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6672, Invalid=6900, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:08:05,995 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 117 states. [2018-09-26 08:08:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:06,752 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:08:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:08:06,752 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2018-09-26 08:08:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:06,753 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:08:06,753 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:08:06,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20010, Invalid=33120, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:08:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:08:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-26 08:08:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:08:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:08:06,764 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-09-26 08:08:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:06,764 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:08:06,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:08:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:08:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:08:06,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:06,765 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-09-26 08:08:06,765 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:06,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:06,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1607816079, now seen corresponding path program 114 times [2018-09-26 08:08:06,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:07,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:07,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:08:07,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:08:07,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:08:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6788, Invalid=7018, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:08:07,167 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-26 08:08:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:07,798 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-09-26 08:08:07,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:08:07,799 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-26 08:08:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:07,799 INFO L225 Difference]: With dead ends: 238 [2018-09-26 08:08:07,799 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:08:07,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6669 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20358, Invalid=33698, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:08:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:08:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-09-26 08:08:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:08:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-09-26 08:08:07,807 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-09-26 08:08:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:07,807 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-09-26 08:08:07,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:08:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-09-26 08:08:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:08:07,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:07,808 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-09-26 08:08:07,808 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:07,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1077027943, now seen corresponding path program 115 times [2018-09-26 08:08:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:08,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:08,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:08:08,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:08:08,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:08:08,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6905, Invalid=7137, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:08:08,147 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 119 states. [2018-09-26 08:08:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:08,777 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 08:08:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:08:08,777 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 234 [2018-09-26 08:08:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:08,778 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:08:08,778 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:08:08,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20709, Invalid=34281, Unknown=0, NotChecked=0, Total=54990 [2018-09-26 08:08:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:08:08,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-26 08:08:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:08:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 08:08:08,786 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-09-26 08:08:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:08,787 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 08:08:08,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:08:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 08:08:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:08:08,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:08,788 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-09-26 08:08:08,788 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:08,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 63211811, now seen corresponding path program 116 times [2018-09-26 08:08:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:09,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:09,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:08:09,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:08:09,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:08:09,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:08:09,137 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-26 08:08:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:09,815 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-09-26 08:08:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:08:09,815 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-26 08:08:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:09,815 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:08:09,815 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 08:08:09,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6902 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21063, Invalid=34869, Unknown=0, NotChecked=0, Total=55932 [2018-09-26 08:08:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 08:08:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-09-26 08:08:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:08:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:08:09,824 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-09-26 08:08:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:09,824 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:08:09,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:08:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:08:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:08:09,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:09,826 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-09-26 08:08:09,826 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:09,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 616954925, now seen corresponding path program 117 times [2018-09-26 08:08:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:10,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:10,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:08:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:08:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:08:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7142, Invalid=7378, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:08:10,195 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 121 states. [2018-09-26 08:08:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:10,943 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-09-26 08:08:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:08:10,943 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 238 [2018-09-26 08:08:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:10,944 INFO L225 Difference]: With dead ends: 244 [2018-09-26 08:08:10,944 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:08:10,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21420, Invalid=35462, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:08:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:08:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-26 08:08:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:08:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 08:08:10,954 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-09-26 08:08:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:10,954 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 08:08:10,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:08:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 08:08:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:08:10,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:10,956 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-09-26 08:08:10,956 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:10,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:10,956 INFO L82 PathProgramCache]: Analyzing trace with hash 188142775, now seen corresponding path program 118 times [2018-09-26 08:08:10,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:11,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:11,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:08:11,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:08:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:08:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:08:11,313 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-26 08:08:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:11,944 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-26 08:08:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:08:11,944 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-26 08:08:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:11,945 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:08:11,945 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:08:11,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21780, Invalid=36060, Unknown=0, NotChecked=0, Total=57840 [2018-09-26 08:08:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:08:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-09-26 08:08:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:08:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-09-26 08:08:11,953 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-09-26 08:08:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:11,954 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-09-26 08:08:11,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:08:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-09-26 08:08:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:08:11,954 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:11,954 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-09-26 08:08:11,955 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:11,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash 416527041, now seen corresponding path program 119 times [2018-09-26 08:08:11,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:12,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:12,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:08:12,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:08:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:08:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7383, Invalid=7623, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:08:12,326 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 123 states. [2018-09-26 08:08:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:13,074 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-09-26 08:08:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:08:13,075 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 242 [2018-09-26 08:08:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:13,075 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:08:13,075 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 08:08:13,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22143, Invalid=36663, Unknown=0, NotChecked=0, Total=58806 [2018-09-26 08:08:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 08:08:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-26 08:08:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:08:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:08:13,084 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-09-26 08:08:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:13,084 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:08:13,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:08:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:08:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:08:13,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:13,085 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-09-26 08:08:13,085 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:13,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 850474571, now seen corresponding path program 120 times [2018-09-26 08:08:13,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:13,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:13,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:08:13,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:08:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:08:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7505, Invalid=7747, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:08:13,465 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-26 08:08:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:14,232 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-26 08:08:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:08:14,232 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-26 08:08:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:14,232 INFO L225 Difference]: With dead ends: 250 [2018-09-26 08:08:14,232 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 08:08:14,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22509, Invalid=37271, Unknown=0, NotChecked=0, Total=59780 [2018-09-26 08:08:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 08:08:14,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-09-26 08:08:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:08:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-26 08:08:14,241 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-09-26 08:08:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:14,242 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-26 08:08:14,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:08:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-26 08:08:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:08:14,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:14,242 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-09-26 08:08:14,243 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:14,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1262223189, now seen corresponding path program 121 times [2018-09-26 08:08:14,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:14,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:14,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:08:14,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:08:14,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:08:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7628, Invalid=7872, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:08:14,711 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 125 states. [2018-09-26 08:08:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:15,466 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-09-26 08:08:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:08:15,466 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 246 [2018-09-26 08:08:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:15,467 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:08:15,467 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 08:08:15,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7502 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22878, Invalid=37884, Unknown=0, NotChecked=0, Total=60762 [2018-09-26 08:08:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 08:08:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-26 08:08:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:08:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-26 08:08:15,479 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-09-26 08:08:15,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:15,480 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-26 08:08:15,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:08:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-26 08:08:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:08:15,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:15,481 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-09-26 08:08:15,481 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:15,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1815653855, now seen corresponding path program 122 times [2018-09-26 08:08:15,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:15,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:15,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:08:15,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:08:15,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:08:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:08:15,941 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-26 08:08:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:16,740 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-09-26 08:08:16,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:08:16,740 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-26 08:08:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:16,741 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:08:16,741 INFO L226 Difference]: Without dead ends: 252 [2018-09-26 08:08:16,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7625 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23250, Invalid=38502, Unknown=0, NotChecked=0, Total=61752 [2018-09-26 08:08:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-09-26 08:08:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-09-26 08:08:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:08:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:08:16,752 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-09-26 08:08:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:16,752 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:08:16,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:08:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:08:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:08:16,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:16,754 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-09-26 08:08:16,754 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:16,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:16,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1086579177, now seen corresponding path program 123 times [2018-09-26 08:08:16,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:17,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:17,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:08:17,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:08:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:08:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7877, Invalid=8125, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:08:17,242 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 127 states. [2018-09-26 08:08:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:18,150 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-09-26 08:08:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:08:18,151 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 250 [2018-09-26 08:08:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:18,151 INFO L225 Difference]: With dead ends: 256 [2018-09-26 08:08:18,151 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:08:18,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7749 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23625, Invalid=39125, Unknown=0, NotChecked=0, Total=62750 [2018-09-26 08:08:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:08:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-26 08:08:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:08:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-26 08:08:18,214 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-09-26 08:08:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:18,214 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-26 08:08:18,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:08:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-26 08:08:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:08:18,215 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:18,215 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-09-26 08:08:18,216 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:18,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash 525482867, now seen corresponding path program 124 times [2018-09-26 08:08:18,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:18,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:18,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:08:18,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:08:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:08:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:08:18,656 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-26 08:08:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:19,445 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-09-26 08:08:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:08:19,445 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-26 08:08:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:19,446 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:08:19,446 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:08:19,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7874 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24003, Invalid=39753, Unknown=0, NotChecked=0, Total=63756 [2018-09-26 08:08:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:08:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2018-09-26 08:08:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:08:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-09-26 08:08:19,457 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-09-26 08:08:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:19,458 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-09-26 08:08:19,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:08:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-09-26 08:08:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:08:19,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:19,459 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-09-26 08:08:19,459 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:19,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1817159043, now seen corresponding path program 125 times [2018-09-26 08:08:19,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:19,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:19,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:08:19,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:08:19,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:08:19,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8130, Invalid=8382, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:08:19,949 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 129 states. [2018-09-26 08:08:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:20,875 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-26 08:08:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:08:20,875 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 254 [2018-09-26 08:08:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:20,876 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:08:20,876 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 08:08:20,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8000 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24384, Invalid=40386, Unknown=0, NotChecked=0, Total=64770 [2018-09-26 08:08:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 08:08:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-26 08:08:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:08:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 08:08:20,887 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-09-26 08:08:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:20,887 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 08:08:20,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:08:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 08:08:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:08:20,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:20,888 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-09-26 08:08:20,889 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:20,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1761795847, now seen corresponding path program 126 times [2018-09-26 08:08:20,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:21,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:21,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:08:21,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:08:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:08:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8258, Invalid=8512, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:08:21,404 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-26 08:08:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:22,335 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-09-26 08:08:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:08:22,335 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-26 08:08:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:22,336 INFO L225 Difference]: With dead ends: 262 [2018-09-26 08:08:22,336 INFO L226 Difference]: Without dead ends: 260 [2018-09-26 08:08:22,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24768, Invalid=41024, Unknown=0, NotChecked=0, Total=65792 [2018-09-26 08:08:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-26 08:08:22,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-09-26 08:08:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:08:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-09-26 08:08:22,344 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-09-26 08:08:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:22,345 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-09-26 08:08:22,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:08:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-09-26 08:08:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:08:22,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:22,346 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-09-26 08:08:22,346 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:22,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash 868641041, now seen corresponding path program 127 times [2018-09-26 08:08:22,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:22,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:22,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:08:22,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:08:22,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:08:22,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8387, Invalid=8643, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:08:22,805 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 131 states. [2018-09-26 08:08:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:23,715 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-09-26 08:08:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:08:23,715 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 258 [2018-09-26 08:08:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:23,716 INFO L225 Difference]: With dead ends: 264 [2018-09-26 08:08:23,716 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 08:08:23,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8255 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25155, Invalid=41667, Unknown=0, NotChecked=0, Total=66822 [2018-09-26 08:08:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 08:08:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-26 08:08:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:08:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 08:08:23,731 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-09-26 08:08:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:23,731 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 08:08:23,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:08:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 08:08:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:08:23,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:23,733 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-09-26 08:08:23,733 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:23,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1540331675, now seen corresponding path program 128 times [2018-09-26 08:08:23,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:24,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:24,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:08:24,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:08:24,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:08:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8517, Invalid=8775, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:08:24,225 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-26 08:08:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:25,143 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-09-26 08:08:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:08:25,143 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-26 08:08:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:25,144 INFO L225 Difference]: With dead ends: 266 [2018-09-26 08:08:25,144 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 08:08:25,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25545, Invalid=42315, Unknown=0, NotChecked=0, Total=67860 [2018-09-26 08:08:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 08:08:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2018-09-26 08:08:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:08:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-09-26 08:08:25,155 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-09-26 08:08:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:25,155 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-09-26 08:08:25,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:08:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-09-26 08:08:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:08:25,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:25,157 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-09-26 08:08:25,157 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:25,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1505030747, now seen corresponding path program 129 times [2018-09-26 08:08:25,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:25,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:25,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:08:25,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:08:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:08:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8648, Invalid=8908, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:08:25,669 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 133 states. [2018-09-26 08:08:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:26,543 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-09-26 08:08:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:08:26,543 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 262 [2018-09-26 08:08:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:26,543 INFO L225 Difference]: With dead ends: 268 [2018-09-26 08:08:26,544 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 08:08:26,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8514 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25938, Invalid=42968, Unknown=0, NotChecked=0, Total=68906 [2018-09-26 08:08:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 08:08:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-26 08:08:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:08:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-26 08:08:26,554 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-09-26 08:08:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:26,554 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-26 08:08:26,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:08:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-26 08:08:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:08:26,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:26,555 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-09-26 08:08:26,555 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:26,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1069377583, now seen corresponding path program 130 times [2018-09-26 08:08:26,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:27,062 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:27,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:08:27,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:08:27,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:08:27,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=9042, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:08:27,064 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-26 08:08:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:28,014 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-09-26 08:08:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:08:28,014 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-26 08:08:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:28,015 INFO L225 Difference]: With dead ends: 270 [2018-09-26 08:08:28,015 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 08:08:28,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8645 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26334, Invalid=43626, Unknown=0, NotChecked=0, Total=69960 [2018-09-26 08:08:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 08:08:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-09-26 08:08:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:08:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-09-26 08:08:28,027 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-09-26 08:08:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:28,027 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-09-26 08:08:28,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:08:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-09-26 08:08:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:08:28,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:28,028 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-09-26 08:08:28,028 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:28,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1174620217, now seen corresponding path program 131 times [2018-09-26 08:08:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:28,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:28,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:08:28,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:08:28,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:08:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8913, Invalid=9177, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:08:28,545 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 135 states. [2018-09-26 08:08:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:29,422 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-09-26 08:08:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:08:29,423 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 266 [2018-09-26 08:08:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:29,423 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:08:29,423 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 08:08:29,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8777 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26733, Invalid=44289, Unknown=0, NotChecked=0, Total=71022 [2018-09-26 08:08:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 08:08:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-26 08:08:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:08:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 08:08:29,433 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-09-26 08:08:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:29,433 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 08:08:29,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:08:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 08:08:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:08:29,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:29,434 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-09-26 08:08:29,434 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:29,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash -766423613, now seen corresponding path program 132 times [2018-09-26 08:08:29,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:29,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:29,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:08:29,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:08:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:08:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9047, Invalid=9313, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:08:29,954 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-26 08:08:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:30,733 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-09-26 08:08:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:08:30,733 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-26 08:08:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:30,734 INFO L225 Difference]: With dead ends: 274 [2018-09-26 08:08:30,734 INFO L226 Difference]: Without dead ends: 272 [2018-09-26 08:08:30,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8910 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27135, Invalid=44957, Unknown=0, NotChecked=0, Total=72092 [2018-09-26 08:08:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-26 08:08:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-09-26 08:08:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:08:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-26 08:08:30,744 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-09-26 08:08:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:30,744 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-26 08:08:30,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:08:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-26 08:08:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:08:30,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:30,745 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-09-26 08:08:30,745 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:30,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2093737779, now seen corresponding path program 133 times [2018-09-26 08:08:30,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:31,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:31,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:08:31,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:08:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:08:31,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9182, Invalid=9450, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:08:31,261 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 137 states. [2018-09-26 08:08:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:32,141 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-09-26 08:08:32,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:08:32,142 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 270 [2018-09-26 08:08:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:32,143 INFO L225 Difference]: With dead ends: 276 [2018-09-26 08:08:32,143 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 08:08:32,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9044 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27540, Invalid=45630, Unknown=0, NotChecked=0, Total=73170 [2018-09-26 08:08:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 08:08:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-26 08:08:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:08:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-26 08:08:32,157 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-09-26 08:08:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:32,157 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-26 08:08:32,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:08:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-26 08:08:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:08:32,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:32,159 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-09-26 08:08:32,159 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:32,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2037364393, now seen corresponding path program 134 times [2018-09-26 08:08:32,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:32,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:32,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:08:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:08:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:08:32,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9318, Invalid=9588, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:08:32,665 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-26 08:08:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:33,591 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-09-26 08:08:33,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:08:33,591 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-26 08:08:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:33,592 INFO L225 Difference]: With dead ends: 278 [2018-09-26 08:08:33,592 INFO L226 Difference]: Without dead ends: 276 [2018-09-26 08:08:33,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27948, Invalid=46308, Unknown=0, NotChecked=0, Total=74256 [2018-09-26 08:08:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-26 08:08:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2018-09-26 08:08:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:08:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-09-26 08:08:33,603 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-09-26 08:08:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:33,603 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-09-26 08:08:33,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:08:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-09-26 08:08:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:08:33,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:33,604 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-09-26 08:08:33,604 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:33,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash 597852001, now seen corresponding path program 135 times [2018-09-26 08:08:33,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:34,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:34,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:08:34,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:08:34,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:08:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9455, Invalid=9727, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:08:34,130 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 139 states. [2018-09-26 08:08:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:35,145 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-09-26 08:08:35,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:08:35,145 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 274 [2018-09-26 08:08:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:35,146 INFO L225 Difference]: With dead ends: 280 [2018-09-26 08:08:35,146 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 08:08:35,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9315 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28359, Invalid=46991, Unknown=0, NotChecked=0, Total=75350 [2018-09-26 08:08:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 08:08:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-26 08:08:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:08:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-26 08:08:35,158 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-09-26 08:08:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:35,158 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-26 08:08:35,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:08:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-26 08:08:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:08:35,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:35,160 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-09-26 08:08:35,160 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:35,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash -989898005, now seen corresponding path program 136 times [2018-09-26 08:08:35,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:35,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:35,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:08:35,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:08:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:08:35,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9593, Invalid=9867, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:08:35,708 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-26 08:08:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:36,794 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-09-26 08:08:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:08:36,794 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-26 08:08:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:36,795 INFO L225 Difference]: With dead ends: 282 [2018-09-26 08:08:36,795 INFO L226 Difference]: Without dead ends: 280 [2018-09-26 08:08:36,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9452 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28773, Invalid=47679, Unknown=0, NotChecked=0, Total=76452 [2018-09-26 08:08:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-26 08:08:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2018-09-26 08:08:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:08:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-09-26 08:08:36,812 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-09-26 08:08:36,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:36,812 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-09-26 08:08:36,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:08:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-09-26 08:08:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:08:36,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:36,813 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-09-26 08:08:36,814 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:36,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2104263691, now seen corresponding path program 137 times [2018-09-26 08:08:36,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:37,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:37,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:08:37,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:08:37,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:08:37,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9732, Invalid=10008, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:08:37,489 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 141 states. [2018-09-26 08:08:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:38,560 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-09-26 08:08:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:08:38,561 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 278 [2018-09-26 08:08:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:38,561 INFO L225 Difference]: With dead ends: 284 [2018-09-26 08:08:38,561 INFO L226 Difference]: Without dead ends: 282 [2018-09-26 08:08:38,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9590 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29190, Invalid=48372, Unknown=0, NotChecked=0, Total=77562 [2018-09-26 08:08:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-26 08:08:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-26 08:08:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:08:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 08:08:38,574 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-09-26 08:08:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:38,574 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 08:08:38,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:08:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 08:08:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:08:38,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:38,575 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-09-26 08:08:38,575 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:38,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 732136063, now seen corresponding path program 138 times [2018-09-26 08:08:38,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:39,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:39,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:08:39,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:08:39,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:08:39,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9872, Invalid=10150, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:08:39,155 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-26 08:08:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:40,295 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-09-26 08:08:40,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:08:40,295 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-26 08:08:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:40,296 INFO L225 Difference]: With dead ends: 286 [2018-09-26 08:08:40,296 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 08:08:40,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9729 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29610, Invalid=49070, Unknown=0, NotChecked=0, Total=78680 [2018-09-26 08:08:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 08:08:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-09-26 08:08:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:08:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-09-26 08:08:40,308 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-09-26 08:08:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:40,308 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-09-26 08:08:40,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:08:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-09-26 08:08:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:08:40,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:40,309 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-09-26 08:08:40,309 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:40,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash -791933303, now seen corresponding path program 139 times [2018-09-26 08:08:40,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:40,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:40,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:08:40,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:08:40,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:08:40,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10013, Invalid=10293, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:08:40,952 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 143 states. [2018-09-26 08:08:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:41,936 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-09-26 08:08:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:08:41,936 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 282 [2018-09-26 08:08:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:41,937 INFO L225 Difference]: With dead ends: 288 [2018-09-26 08:08:41,937 INFO L226 Difference]: Without dead ends: 286 [2018-09-26 08:08:41,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9869 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30033, Invalid=49773, Unknown=0, NotChecked=0, Total=79806 [2018-09-26 08:08:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-26 08:08:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-26 08:08:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:08:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-26 08:08:41,948 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-09-26 08:08:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:41,948 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-26 08:08:41,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:08:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-26 08:08:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:08:41,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:41,949 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-09-26 08:08:41,950 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:41,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash -838746093, now seen corresponding path program 140 times [2018-09-26 08:08:41,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:42,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:42,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:08:42,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:08:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:08:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10155, Invalid=10437, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:08:42,536 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-26 08:08:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:43,674 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-26 08:08:43,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:08:43,674 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-26 08:08:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:43,675 INFO L225 Difference]: With dead ends: 290 [2018-09-26 08:08:43,675 INFO L226 Difference]: Without dead ends: 288 [2018-09-26 08:08:43,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10010 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30459, Invalid=50481, Unknown=0, NotChecked=0, Total=80940 [2018-09-26 08:08:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-09-26 08:08:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2018-09-26 08:08:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:08:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-26 08:08:43,692 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-09-26 08:08:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:43,692 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-26 08:08:43,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:08:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-26 08:08:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:08:43,693 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:43,694 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-09-26 08:08:43,694 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:43,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1418802973, now seen corresponding path program 141 times [2018-09-26 08:08:43,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:44,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:44,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:08:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:08:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:08:44,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10298, Invalid=10582, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:08:44,311 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 145 states. [2018-09-26 08:08:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:45,345 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-09-26 08:08:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:08:45,346 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 286 [2018-09-26 08:08:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:45,346 INFO L225 Difference]: With dead ends: 292 [2018-09-26 08:08:45,346 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 08:08:45,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30888, Invalid=51194, Unknown=0, NotChecked=0, Total=82082 [2018-09-26 08:08:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 08:08:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-26 08:08:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:08:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-26 08:08:45,357 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-09-26 08:08:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:45,357 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-26 08:08:45,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:08:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-26 08:08:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:08:45,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:45,358 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-09-26 08:08:45,358 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:45,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1964970919, now seen corresponding path program 142 times [2018-09-26 08:08:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:45,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:45,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:08:45,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:08:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:08:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10442, Invalid=10728, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:08:45,944 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-26 08:08:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:47,082 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-09-26 08:08:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:08:47,082 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-26 08:08:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:47,083 INFO L225 Difference]: With dead ends: 294 [2018-09-26 08:08:47,083 INFO L226 Difference]: Without dead ends: 292 [2018-09-26 08:08:47,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31320, Invalid=51912, Unknown=0, NotChecked=0, Total=83232 [2018-09-26 08:08:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-09-26 08:08:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2018-09-26 08:08:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:08:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-26 08:08:47,096 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-09-26 08:08:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:47,097 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-26 08:08:47,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:08:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-26 08:08:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:08:47,097 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:47,098 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-09-26 08:08:47,098 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:47,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1448610383, now seen corresponding path program 143 times [2018-09-26 08:08:47,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:47,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:47,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:08:47,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:08:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:08:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10587, Invalid=10875, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:08:47,708 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 147 states. [2018-09-26 08:08:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:48,909 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-09-26 08:08:48,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:08:48,909 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 290 [2018-09-26 08:08:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:48,910 INFO L225 Difference]: With dead ends: 296 [2018-09-26 08:08:48,910 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 08:08:48,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10439 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31755, Invalid=52635, Unknown=0, NotChecked=0, Total=84390 [2018-09-26 08:08:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 08:08:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-26 08:08:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:08:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-26 08:08:48,919 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-09-26 08:08:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:48,919 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-26 08:08:48,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:08:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-26 08:08:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:08:48,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:48,920 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-09-26 08:08:48,921 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:48,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash -545227461, now seen corresponding path program 144 times [2018-09-26 08:08:48,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:49,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:49,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:08:49,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:08:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:08:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10733, Invalid=11023, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:08:49,540 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-26 08:08:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:50,712 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-09-26 08:08:50,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:08:50,712 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-26 08:08:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:50,713 INFO L225 Difference]: With dead ends: 298 [2018-09-26 08:08:50,713 INFO L226 Difference]: Without dead ends: 296 [2018-09-26 08:08:50,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10584 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=32193, Invalid=53363, Unknown=0, NotChecked=0, Total=85556 [2018-09-26 08:08:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-26 08:08:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2018-09-26 08:08:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:08:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-09-26 08:08:50,726 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-09-26 08:08:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:50,726 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-09-26 08:08:50,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:08:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-09-26 08:08:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:08:50,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:50,727 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-09-26 08:08:50,727 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:50,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash 22366789, now seen corresponding path program 145 times [2018-09-26 08:08:50,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:51,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:51,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:08:51,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:08:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:08:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10880, Invalid=11172, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:08:51,356 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 149 states. [2018-09-26 08:08:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:52,629 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-09-26 08:08:52,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:08:52,629 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 294 [2018-09-26 08:08:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:52,630 INFO L225 Difference]: With dead ends: 300 [2018-09-26 08:08:52,630 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 08:08:52,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10730 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32634, Invalid=54096, Unknown=0, NotChecked=0, Total=86730 [2018-09-26 08:08:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 08:08:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-26 08:08:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:08:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-26 08:08:52,643 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-09-26 08:08:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:52,643 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-26 08:08:52,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:08:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-26 08:08:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:08:52,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:52,645 INFO L375 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-09-26 08:08:52,645 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:52,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 19594447, now seen corresponding path program 146 times [2018-09-26 08:08:52,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:53,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:53,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:08:53,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:08:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:08:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11028, Invalid=11322, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:08:53,272 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-26 08:08:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:54,486 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-09-26 08:08:54,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:08:54,486 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-26 08:08:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:54,487 INFO L225 Difference]: With dead ends: 302 [2018-09-26 08:08:54,487 INFO L226 Difference]: Without dead ends: 300 [2018-09-26 08:08:54,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10877 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=33078, Invalid=54834, Unknown=0, NotChecked=0, Total=87912 [2018-09-26 08:08:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-09-26 08:08:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2018-09-26 08:08:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:08:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-09-26 08:08:54,500 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-09-26 08:08:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:54,501 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-09-26 08:08:54,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:08:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-09-26 08:08:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:08:54,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:54,502 INFO L375 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-09-26 08:08:54,502 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:54,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1650341081, now seen corresponding path program 147 times [2018-09-26 08:08:54,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:55,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:55,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:08:55,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:08:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:08:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=11473, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:08:55,141 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 151 states. [2018-09-26 08:08:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:56,431 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-09-26 08:08:56,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:08:56,431 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 298 [2018-09-26 08:08:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:56,432 INFO L225 Difference]: With dead ends: 304 [2018-09-26 08:08:56,432 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 08:08:56,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11025 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=33525, Invalid=55577, Unknown=0, NotChecked=0, Total=89102 [2018-09-26 08:08:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 08:08:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-26 08:08:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:08:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-26 08:08:56,451 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-09-26 08:08:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:56,451 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-26 08:08:56,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:08:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-26 08:08:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:08:56,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:56,453 INFO L375 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-09-26 08:08:56,453 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:56,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1134793315, now seen corresponding path program 148 times [2018-09-26 08:08:56,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:57,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:57,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:08:57,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:08:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:08:57,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11327, Invalid=11625, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:08:57,180 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-26 08:08:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:58,428 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-09-26 08:08:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:08:58,429 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-26 08:08:58,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:58,429 INFO L225 Difference]: With dead ends: 306 [2018-09-26 08:08:58,429 INFO L226 Difference]: Without dead ends: 304 [2018-09-26 08:08:58,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11174 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=33975, Invalid=56325, Unknown=0, NotChecked=0, Total=90300 [2018-09-26 08:08:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-26 08:08:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2018-09-26 08:08:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:08:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-09-26 08:08:58,443 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-09-26 08:08:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:58,443 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-09-26 08:08:58,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:08:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-09-26 08:08:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:08:58,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:58,444 INFO L375 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-09-26 08:08:58,444 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:58,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash -385370771, now seen corresponding path program 149 times [2018-09-26 08:08:58,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:59,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:59,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:08:59,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:08:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:08:59,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11478, Invalid=11778, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:08:59,107 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 153 states. [2018-09-26 08:09:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:00,429 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-09-26 08:09:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:09:00,429 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 302 [2018-09-26 08:09:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:00,429 INFO L225 Difference]: With dead ends: 308 [2018-09-26 08:09:00,429 INFO L226 Difference]: Without dead ends: 306 [2018-09-26 08:09:00,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11324 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=34428, Invalid=57078, Unknown=0, NotChecked=0, Total=91506 [2018-09-26 08:09:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-26 08:09:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-26 08:09:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:09:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-26 08:09:00,443 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-09-26 08:09:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:00,443 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-26 08:09:00,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:09:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-26 08:09:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:09:00,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:00,444 INFO L375 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-09-26 08:09:00,445 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:00,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -974176777, now seen corresponding path program 150 times [2018-09-26 08:09:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:01,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:01,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:09:01,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:09:01,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:09:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11630, Invalid=11932, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:09:01,159 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-26 08:09:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:02,462 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-09-26 08:09:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:09:02,462 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-26 08:09:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:02,463 INFO L225 Difference]: With dead ends: 310 [2018-09-26 08:09:02,463 INFO L226 Difference]: Without dead ends: 308 [2018-09-26 08:09:02,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11475 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=34884, Invalid=57836, Unknown=0, NotChecked=0, Total=92720 [2018-09-26 08:09:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-09-26 08:09:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2018-09-26 08:09:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:09:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-09-26 08:09:02,477 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-09-26 08:09:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-09-26 08:09:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:09:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-09-26 08:09:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:09:02,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:02,478 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-09-26 08:09:02,478 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:02,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 118934529, now seen corresponding path program 151 times [2018-09-26 08:09:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:03,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:03,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:09:03,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:09:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:09:03,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11783, Invalid=12087, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:09:03,138 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 155 states. [2018-09-26 08:09:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:04,482 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-09-26 08:09:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:09:04,482 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 306 [2018-09-26 08:09:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:04,483 INFO L225 Difference]: With dead ends: 312 [2018-09-26 08:09:04,483 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 08:09:04,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11627 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=35343, Invalid=58599, Unknown=0, NotChecked=0, Total=93942 [2018-09-26 08:09:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 08:09:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-26 08:09:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:09:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-26 08:09:04,498 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-09-26 08:09:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:04,498 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-26 08:09:04,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:09:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-26 08:09:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:09:04,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:04,499 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-09-26 08:09:04,500 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:04,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1668087925, now seen corresponding path program 152 times [2018-09-26 08:09:04,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:05,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:05,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:09:05,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:09:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:09:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11937, Invalid=12243, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:09:05,220 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2018-09-26 08:09:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:06,533 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-09-26 08:09:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:09:06,533 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2018-09-26 08:09:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:06,534 INFO L225 Difference]: With dead ends: 314 [2018-09-26 08:09:06,534 INFO L226 Difference]: Without dead ends: 312 [2018-09-26 08:09:06,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11780 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=35805, Invalid=59367, Unknown=0, NotChecked=0, Total=95172 [2018-09-26 08:09:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-09-26 08:09:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2018-09-26 08:09:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:09:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-09-26 08:09:06,548 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-09-26 08:09:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:06,548 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-09-26 08:09:06,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:09:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-09-26 08:09:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:09:06,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:06,549 INFO L375 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-09-26 08:09:06,549 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:06,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1009747819, now seen corresponding path program 153 times [2018-09-26 08:09:06,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:07,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:07,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:09:07,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:09:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:09:07,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12092, Invalid=12400, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:09:07,261 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 157 states. [2018-09-26 08:09:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:08,600 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-09-26 08:09:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:09:08,601 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 310 [2018-09-26 08:09:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:08,601 INFO L225 Difference]: With dead ends: 316 [2018-09-26 08:09:08,601 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 08:09:08,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11934 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36270, Invalid=60140, Unknown=0, NotChecked=0, Total=96410 [2018-09-26 08:09:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 08:09:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-09-26 08:09:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:09:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-09-26 08:09:08,611 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-09-26 08:09:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:08,611 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-09-26 08:09:08,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:09:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-09-26 08:09:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:09:08,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:08,612 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-09-26 08:09:08,613 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:08,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash 294901535, now seen corresponding path program 154 times [2018-09-26 08:09:08,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:09,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:09,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:09:09,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:09:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:09:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12248, Invalid=12558, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:09:09,234 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2018-09-26 08:09:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:10,395 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-09-26 08:09:10,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:09:10,396 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2018-09-26 08:09:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:10,396 INFO L225 Difference]: With dead ends: 318 [2018-09-26 08:09:10,396 INFO L226 Difference]: Without dead ends: 316 [2018-09-26 08:09:10,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12089 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36738, Invalid=60918, Unknown=0, NotChecked=0, Total=97656 [2018-09-26 08:09:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-09-26 08:09:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2018-09-26 08:09:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:09:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-09-26 08:09:10,413 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-09-26 08:09:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:10,413 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-09-26 08:09:10,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:09:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-09-26 08:09:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:09:10,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:10,415 INFO L375 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-09-26 08:09:10,415 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:10,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -67519703, now seen corresponding path program 155 times [2018-09-26 08:09:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:11,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:11,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:09:11,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:09:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:09:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12405, Invalid=12717, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:09:11,174 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 159 states. [2018-09-26 08:09:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:12,372 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-09-26 08:09:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:09:12,373 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 314 [2018-09-26 08:09:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:12,373 INFO L225 Difference]: With dead ends: 320 [2018-09-26 08:09:12,373 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 08:09:12,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12245 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=37209, Invalid=61701, Unknown=0, NotChecked=0, Total=98910 [2018-09-26 08:09:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 08:09:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2018-09-26 08:09:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-09-26 08:09:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-09-26 08:09:12,382 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-09-26 08:09:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:12,383 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-09-26 08:09:12,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:09:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-09-26 08:09:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-26 08:09:12,384 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:12,384 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-09-26 08:09:12,384 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:12,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash -461978445, now seen corresponding path program 156 times [2018-09-26 08:09:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:12,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:12,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:09:12,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:09:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:09:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12563, Invalid=12877, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:09:13,001 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2018-09-26 08:09:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:14,226 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-09-26 08:09:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:09:14,226 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2018-09-26 08:09:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:14,227 INFO L225 Difference]: With dead ends: 322 [2018-09-26 08:09:14,228 INFO L226 Difference]: Without dead ends: 320 [2018-09-26 08:09:14,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12402 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=37683, Invalid=62489, Unknown=0, NotChecked=0, Total=100172 [2018-09-26 08:09:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-09-26 08:09:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2018-09-26 08:09:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:09:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-09-26 08:09:14,250 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-09-26 08:09:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:14,250 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-09-26 08:09:14,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:09:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-09-26 08:09:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-26 08:09:14,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:14,252 INFO L375 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-09-26 08:09:14,252 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:14,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1579707459, now seen corresponding path program 157 times [2018-09-26 08:09:14,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:14,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:14,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:09:14,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:09:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:09:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12722, Invalid=13038, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:09:14,924 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 161 states. [2018-09-26 08:09:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:16,104 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-09-26 08:09:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:09:16,104 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 318 [2018-09-26 08:09:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:16,105 INFO L225 Difference]: With dead ends: 324 [2018-09-26 08:09:16,105 INFO L226 Difference]: Without dead ends: 322 [2018-09-26 08:09:16,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=38160, Invalid=63282, Unknown=0, NotChecked=0, Total=101442 [2018-09-26 08:09:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-09-26 08:09:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-09-26 08:09:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:09:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-09-26 08:09:16,115 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-09-26 08:09:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:16,115 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-09-26 08:09:16,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:09:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-09-26 08:09:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:09:16,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:16,116 INFO L375 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-09-26 08:09:16,116 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:16,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1975465913, now seen corresponding path program 158 times [2018-09-26 08:09:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:16,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:16,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:09:16,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:09:16,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:09:16,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12882, Invalid=13200, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:09:16,742 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2018-09-26 08:09:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:18,067 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-09-26 08:09:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:09:18,067 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2018-09-26 08:09:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:18,067 INFO L225 Difference]: With dead ends: 326 [2018-09-26 08:09:18,067 INFO L226 Difference]: Without dead ends: 324 [2018-09-26 08:09:18,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12719 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=38640, Invalid=64080, Unknown=0, NotChecked=0, Total=102720 [2018-09-26 08:09:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-09-26 08:09:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2018-09-26 08:09:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-26 08:09:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-09-26 08:09:18,080 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-09-26 08:09:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:18,080 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-09-26 08:09:18,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:09:18,080 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-09-26 08:09:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-26 08:09:18,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:18,081 INFO L375 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-09-26 08:09:18,081 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:18,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash -47250863, now seen corresponding path program 159 times [2018-09-26 08:09:18,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:18,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:18,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:09:18,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:09:18,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:09:18,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13043, Invalid=13363, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:09:18,788 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 163 states. [2018-09-26 08:09:19,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:19,959 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-09-26 08:09:19,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:09:19,960 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 322 [2018-09-26 08:09:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:19,960 INFO L225 Difference]: With dead ends: 328 [2018-09-26 08:09:19,960 INFO L226 Difference]: Without dead ends: 326 [2018-09-26 08:09:19,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12879 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39123, Invalid=64883, Unknown=0, NotChecked=0, Total=104006 [2018-09-26 08:09:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-09-26 08:09:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-09-26 08:09:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 08:09:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-09-26 08:09:19,972 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-09-26 08:09:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:19,972 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-09-26 08:09:19,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:09:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-09-26 08:09:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-26 08:09:19,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:19,973 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-09-26 08:09:19,973 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:19,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1836507611, now seen corresponding path program 160 times [2018-09-26 08:09:19,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:20,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:20,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:09:20,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:09:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:09:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13205, Invalid=13527, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:09:20,676 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2018-09-26 08:09:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:22,040 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-09-26 08:09:22,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:09:22,040 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2018-09-26 08:09:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:22,041 INFO L225 Difference]: With dead ends: 330 [2018-09-26 08:09:22,041 INFO L226 Difference]: Without dead ends: 328 [2018-09-26 08:09:22,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13040 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=39609, Invalid=65691, Unknown=0, NotChecked=0, Total=105300 [2018-09-26 08:09:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-09-26 08:09:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2018-09-26 08:09:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-26 08:09:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-09-26 08:09:22,053 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-09-26 08:09:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:22,053 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-09-26 08:09:22,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:09:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-09-26 08:09:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-26 08:09:22,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:22,054 INFO L375 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-09-26 08:09:22,054 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash -347797787, now seen corresponding path program 161 times [2018-09-26 08:09:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:22,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:22,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:09:22,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:09:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:09:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13368, Invalid=13692, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:09:22,756 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 165 states. [2018-09-26 08:09:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:24,060 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-09-26 08:09:24,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:09:24,060 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 326 [2018-09-26 08:09:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:24,061 INFO L225 Difference]: With dead ends: 332 [2018-09-26 08:09:24,061 INFO L226 Difference]: Without dead ends: 330 [2018-09-26 08:09:24,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13202 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=40098, Invalid=66504, Unknown=0, NotChecked=0, Total=106602 [2018-09-26 08:09:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-09-26 08:09:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-09-26 08:09:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-09-26 08:09:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-09-26 08:09:24,073 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-09-26 08:09:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:24,073 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-09-26 08:09:24,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:09:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-09-26 08:09:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-26 08:09:24,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:24,074 INFO L375 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-09-26 08:09:24,074 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:24,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:24,075 INFO L82 PathProgramCache]: Analyzing trace with hash 773722479, now seen corresponding path program 162 times [2018-09-26 08:09:24,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:24,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:24,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:09:24,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:09:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:09:24,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13532, Invalid=13858, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:09:24,849 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2018-09-26 08:09:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:26,426 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-09-26 08:09:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:09:26,426 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2018-09-26 08:09:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:26,426 INFO L225 Difference]: With dead ends: 334 [2018-09-26 08:09:26,426 INFO L226 Difference]: Without dead ends: 332 [2018-09-26 08:09:26,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13365 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=40590, Invalid=67322, Unknown=0, NotChecked=0, Total=107912 [2018-09-26 08:09:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-09-26 08:09:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2018-09-26 08:09:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:09:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-09-26 08:09:26,442 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-09-26 08:09:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:26,442 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-09-26 08:09:26,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:09:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-09-26 08:09:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:09:26,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:26,444 INFO L375 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-09-26 08:09:26,444 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash 517906809, now seen corresponding path program 163 times [2018-09-26 08:09:26,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:27,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:27,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:09:27,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:09:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:09:27,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13697, Invalid=14025, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:09:27,263 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 167 states. [2018-09-26 08:09:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:28,824 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2018-09-26 08:09:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:09:28,824 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 330 [2018-09-26 08:09:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:28,825 INFO L225 Difference]: With dead ends: 336 [2018-09-26 08:09:28,825 INFO L226 Difference]: Without dead ends: 334 [2018-09-26 08:09:28,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13529 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41085, Invalid=68145, Unknown=0, NotChecked=0, Total=109230 [2018-09-26 08:09:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-09-26 08:09:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-09-26 08:09:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-09-26 08:09:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-09-26 08:09:28,840 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-09-26 08:09:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:28,841 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-09-26 08:09:28,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:09:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-09-26 08:09:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-26 08:09:28,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:28,842 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-09-26 08:09:28,842 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:28,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -507816189, now seen corresponding path program 164 times [2018-09-26 08:09:28,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:29,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:29,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:09:29,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:09:29,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:09:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13863, Invalid=14193, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:09:29,652 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2018-09-26 08:09:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:30,890 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-09-26 08:09:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:09:30,890 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2018-09-26 08:09:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:30,891 INFO L225 Difference]: With dead ends: 338 [2018-09-26 08:09:30,891 INFO L226 Difference]: Without dead ends: 336 [2018-09-26 08:09:30,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13694 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41583, Invalid=68973, Unknown=0, NotChecked=0, Total=110556 [2018-09-26 08:09:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-09-26 08:09:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2018-09-26 08:09:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-26 08:09:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-09-26 08:09:30,902 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-09-26 08:09:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:30,903 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-09-26 08:09:30,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:09:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-09-26 08:09:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-09-26 08:09:30,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:30,904 INFO L375 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-09-26 08:09:30,904 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:30,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1614860813, now seen corresponding path program 165 times [2018-09-26 08:09:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:31,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:31,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:09:31,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:09:31,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:09:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14030, Invalid=14362, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:09:31,583 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 169 states. [2018-09-26 08:09:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:32,974 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-09-26 08:09:32,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:09:32,974 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 334 [2018-09-26 08:09:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:32,975 INFO L225 Difference]: With dead ends: 340 [2018-09-26 08:09:32,975 INFO L226 Difference]: Without dead ends: 338 [2018-09-26 08:09:32,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13860 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=42084, Invalid=69806, Unknown=0, NotChecked=0, Total=111890 [2018-09-26 08:09:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-09-26 08:09:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-09-26 08:09:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:09:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-09-26 08:09:32,988 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-09-26 08:09:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:32,988 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-09-26 08:09:32,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:09:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-09-26 08:09:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-26 08:09:32,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:32,989 INFO L375 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-09-26 08:09:32,989 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:32,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1397994135, now seen corresponding path program 166 times [2018-09-26 08:09:32,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:33,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:33,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:09:33,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:09:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:09:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14198, Invalid=14532, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:09:33,728 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2018-09-26 08:09:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:35,079 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-09-26 08:09:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:09:35,080 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2018-09-26 08:09:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:35,080 INFO L225 Difference]: With dead ends: 342 [2018-09-26 08:09:35,080 INFO L226 Difference]: Without dead ends: 340 [2018-09-26 08:09:35,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14027 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=42588, Invalid=70644, Unknown=0, NotChecked=0, Total=113232 [2018-09-26 08:09:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-26 08:09:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2018-09-26 08:09:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:09:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-09-26 08:09:35,093 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-09-26 08:09:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:35,093 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-09-26 08:09:35,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:09:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-09-26 08:09:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:09:35,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:35,094 INFO L375 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-09-26 08:09:35,094 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:35,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash -852453215, now seen corresponding path program 167 times [2018-09-26 08:09:35,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:35,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:35,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:09:35,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:09:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:09:35,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14367, Invalid=14703, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:09:35,903 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 171 states. [2018-09-26 08:09:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:37,510 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-09-26 08:09:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:09:37,510 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 338 [2018-09-26 08:09:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:37,511 INFO L225 Difference]: With dead ends: 344 [2018-09-26 08:09:37,511 INFO L226 Difference]: Without dead ends: 342 [2018-09-26 08:09:37,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=43095, Invalid=71487, Unknown=0, NotChecked=0, Total=114582 [2018-09-26 08:09:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-09-26 08:09:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-09-26 08:09:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:09:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-09-26 08:09:37,522 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-09-26 08:09:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:37,523 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-09-26 08:09:37,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:09:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-09-26 08:09:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:09:37,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:37,524 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-09-26 08:09:37,524 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:37,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1131160619, now seen corresponding path program 168 times [2018-09-26 08:09:37,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:38,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:38,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:09:38,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:09:38,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:09:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14537, Invalid=14875, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:09:38,373 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2018-09-26 08:09:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:40,069 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-09-26 08:09:40,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:09:40,069 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2018-09-26 08:09:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:40,069 INFO L225 Difference]: With dead ends: 346 [2018-09-26 08:09:40,070 INFO L226 Difference]: Without dead ends: 344 [2018-09-26 08:09:40,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14364 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=43605, Invalid=72335, Unknown=0, NotChecked=0, Total=115940 [2018-09-26 08:09:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-09-26 08:09:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2018-09-26 08:09:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:09:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-09-26 08:09:40,086 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-09-26 08:09:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:40,086 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-09-26 08:09:40,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:09:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-09-26 08:09:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-09-26 08:09:40,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:40,087 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-09-26 08:09:40,088 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:40,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 418575669, now seen corresponding path program 169 times [2018-09-26 08:09:40,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:41,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:41,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:09:41,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:09:41,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:09:41,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14708, Invalid=15048, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:09:41,017 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 173 states. [2018-09-26 08:09:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:42,616 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-09-26 08:09:42,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:09:42,616 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 342 [2018-09-26 08:09:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:42,617 INFO L225 Difference]: With dead ends: 348 [2018-09-26 08:09:42,617 INFO L226 Difference]: Without dead ends: 346 [2018-09-26 08:09:42,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14534 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44118, Invalid=73188, Unknown=0, NotChecked=0, Total=117306 [2018-09-26 08:09:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-09-26 08:09:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2018-09-26 08:09:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 08:09:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-09-26 08:09:42,632 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-09-26 08:09:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:42,632 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-09-26 08:09:42,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:09:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-09-26 08:09:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-26 08:09:42,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:42,633 INFO L375 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-09-26 08:09:42,633 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:42,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1475761217, now seen corresponding path program 170 times [2018-09-26 08:09:42,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:43,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:43,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:09:43,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:09:43,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:09:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14880, Invalid=15222, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:09:43,523 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2018-09-26 08:09:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:45,271 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-09-26 08:09:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:09:45,272 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2018-09-26 08:09:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:45,272 INFO L225 Difference]: With dead ends: 350 [2018-09-26 08:09:45,272 INFO L226 Difference]: Without dead ends: 348 [2018-09-26 08:09:45,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14705 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=44634, Invalid=74046, Unknown=0, NotChecked=0, Total=118680 [2018-09-26 08:09:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-09-26 08:09:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2018-09-26 08:09:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-09-26 08:09:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-09-26 08:09:45,283 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-09-26 08:09:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:45,283 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-09-26 08:09:45,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:09:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-09-26 08:09:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-26 08:09:45,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:45,285 INFO L375 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-09-26 08:09:45,285 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:45,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash -867375159, now seen corresponding path program 171 times [2018-09-26 08:09:45,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:46,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:46,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:09:46,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:09:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:09:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15053, Invalid=15397, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:09:46,144 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 175 states. [2018-09-26 08:09:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:47,867 INFO L93 Difference]: Finished difference Result 352 states and 352 transitions. [2018-09-26 08:09:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:09:47,867 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 346 [2018-09-26 08:09:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:47,868 INFO L225 Difference]: With dead ends: 352 [2018-09-26 08:09:47,868 INFO L226 Difference]: Without dead ends: 350 [2018-09-26 08:09:47,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14877 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=45153, Invalid=74909, Unknown=0, NotChecked=0, Total=120062 [2018-09-26 08:09:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-09-26 08:09:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-09-26 08:09:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 08:09:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-09-26 08:09:47,885 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-09-26 08:09:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:47,885 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-09-26 08:09:47,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:09:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-09-26 08:09:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-09-26 08:09:47,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:47,886 INFO L375 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-09-26 08:09:47,886 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:47,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:47,887 INFO L82 PathProgramCache]: Analyzing trace with hash -323925677, now seen corresponding path program 172 times [2018-09-26 08:09:47,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:48,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:48,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:09:48,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:09:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:09:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15227, Invalid=15573, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:09:48,837 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2018-09-26 08:09:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:50,216 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-09-26 08:09:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:09:50,216 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2018-09-26 08:09:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:50,217 INFO L225 Difference]: With dead ends: 354 [2018-09-26 08:09:50,217 INFO L226 Difference]: Without dead ends: 352 [2018-09-26 08:09:50,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15050 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45675, Invalid=75777, Unknown=0, NotChecked=0, Total=121452 [2018-09-26 08:09:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-26 08:09:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2018-09-26 08:09:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 08:09:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-09-26 08:09:50,229 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2018-09-26 08:09:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:50,230 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-09-26 08:09:50,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:09:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-09-26 08:09:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-26 08:09:50,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:50,231 INFO L375 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1] [2018-09-26 08:09:50,231 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:50,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2054983587, now seen corresponding path program 173 times [2018-09-26 08:09:50,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:50,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:50,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:09:50,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:09:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:09:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15402, Invalid=15750, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:09:50,992 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 177 states. [2018-09-26 08:09:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:52,655 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-09-26 08:09:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:09:52,655 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 350 [2018-09-26 08:09:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:52,656 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:09:52,656 INFO L226 Difference]: Without dead ends: 354 [2018-09-26 08:09:52,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15224 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=46200, Invalid=76650, Unknown=0, NotChecked=0, Total=122850 [2018-09-26 08:09:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-09-26 08:09:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2018-09-26 08:09:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-09-26 08:09:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-09-26 08:09:52,667 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2018-09-26 08:09:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:52,667 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-09-26 08:09:52,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:09:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-09-26 08:09:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-26 08:09:52,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:52,668 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1] [2018-09-26 08:09:52,668 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:52,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash 845675751, now seen corresponding path program 174 times [2018-09-26 08:09:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:53,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:53,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:09:53,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:09:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:09:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15578, Invalid=15928, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:09:53,572 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2018-09-26 08:09:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:55,087 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-09-26 08:09:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:09:55,088 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2018-09-26 08:09:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:55,088 INFO L225 Difference]: With dead ends: 358 [2018-09-26 08:09:55,088 INFO L226 Difference]: Without dead ends: 356 [2018-09-26 08:09:55,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15399 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=46728, Invalid=77528, Unknown=0, NotChecked=0, Total=124256 [2018-09-26 08:09:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-26 08:09:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2018-09-26 08:09:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-26 08:09:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-09-26 08:09:55,104 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2018-09-26 08:09:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:55,104 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-09-26 08:09:55,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:09:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-09-26 08:09:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-26 08:09:55,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:55,106 INFO L375 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1] [2018-09-26 08:09:55,106 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:55,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 945524465, now seen corresponding path program 175 times [2018-09-26 08:09:55,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:55,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:55,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:09:55,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:09:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:09:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15755, Invalid=16107, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:09:55,966 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 179 states. [2018-09-26 08:09:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:57,425 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-09-26 08:09:57,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:09:57,425 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 354 [2018-09-26 08:09:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:57,426 INFO L225 Difference]: With dead ends: 360 [2018-09-26 08:09:57,426 INFO L226 Difference]: Without dead ends: 358 [2018-09-26 08:09:57,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15575 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=47259, Invalid=78411, Unknown=0, NotChecked=0, Total=125670 [2018-09-26 08:09:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-26 08:09:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2018-09-26 08:09:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-09-26 08:09:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-09-26 08:09:57,440 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2018-09-26 08:09:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:57,440 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-09-26 08:09:57,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:09:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-09-26 08:09:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-09-26 08:09:57,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:57,441 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1] [2018-09-26 08:09:57,441 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:57,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1884109189, now seen corresponding path program 176 times [2018-09-26 08:09:57,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:58,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:58,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:09:58,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:09:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:09:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15933, Invalid=16287, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:09:58,249 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2018-09-26 08:09:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:59,857 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2018-09-26 08:09:59,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:09:59,857 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2018-09-26 08:09:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:59,858 INFO L225 Difference]: With dead ends: 362 [2018-09-26 08:09:59,858 INFO L226 Difference]: Without dead ends: 360 [2018-09-26 08:09:59,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15752 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=47793, Invalid=79299, Unknown=0, NotChecked=0, Total=127092 [2018-09-26 08:09:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-09-26 08:09:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2018-09-26 08:09:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-09-26 08:09:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-09-26 08:09:59,868 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2018-09-26 08:09:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:59,868 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-09-26 08:09:59,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:09:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-09-26 08:09:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-09-26 08:09:59,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:59,870 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1] [2018-09-26 08:09:59,870 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:59,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1847214981, now seen corresponding path program 177 times [2018-09-26 08:09:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:00,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:00,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:10:00,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:10:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:10:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16112, Invalid=16468, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:10:00,752 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 181 states. [2018-09-26 08:10:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:02,606 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-09-26 08:10:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:10:02,606 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 358 [2018-09-26 08:10:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:02,606 INFO L225 Difference]: With dead ends: 364 [2018-09-26 08:10:02,607 INFO L226 Difference]: Without dead ends: 362 [2018-09-26 08:10:02,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15930 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=48330, Invalid=80192, Unknown=0, NotChecked=0, Total=128522 [2018-09-26 08:10:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-09-26 08:10:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-09-26 08:10:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-09-26 08:10:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-09-26 08:10:02,624 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2018-09-26 08:10:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:02,625 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-09-26 08:10:02,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:10:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-09-26 08:10:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-26 08:10:02,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:02,626 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1] [2018-09-26 08:10:02,626 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:02,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:02,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1352050191, now seen corresponding path program 178 times [2018-09-26 08:10:02,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:03,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:03,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:10:03,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:10:03,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:10:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16292, Invalid=16650, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:10:03,626 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2018-09-26 08:10:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:05,316 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2018-09-26 08:10:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:10:05,316 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2018-09-26 08:10:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:05,317 INFO L225 Difference]: With dead ends: 366 [2018-09-26 08:10:05,317 INFO L226 Difference]: Without dead ends: 364 [2018-09-26 08:10:05,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16109 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=48870, Invalid=81090, Unknown=0, NotChecked=0, Total=129960 [2018-09-26 08:10:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-09-26 08:10:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2018-09-26 08:10:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-09-26 08:10:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-09-26 08:10:05,333 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 360 [2018-09-26 08:10:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:05,333 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-09-26 08:10:05,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:10:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-09-26 08:10:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-26 08:10:05,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:05,335 INFO L375 BasicCegarLoop]: trace histogram [180, 179, 1, 1, 1] [2018-09-26 08:10:05,335 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:05,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:05,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2054910439, now seen corresponding path program 179 times [2018-09-26 08:10:05,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:06,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:06,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:10:06,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:10:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:10:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16473, Invalid=16833, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:10:06,284 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 183 states. [2018-09-26 08:10:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:08,108 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-09-26 08:10:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:10:08,109 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 362 [2018-09-26 08:10:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:08,109 INFO L225 Difference]: With dead ends: 368 [2018-09-26 08:10:08,109 INFO L226 Difference]: Without dead ends: 366 [2018-09-26 08:10:08,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16289 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=49413, Invalid=81993, Unknown=0, NotChecked=0, Total=131406 [2018-09-26 08:10:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-09-26 08:10:08,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-09-26 08:10:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-09-26 08:10:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-09-26 08:10:08,122 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 362 [2018-09-26 08:10:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:08,123 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-09-26 08:10:08,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:10:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-09-26 08:10:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-26 08:10:08,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:08,124 INFO L375 BasicCegarLoop]: trace histogram [181, 180, 1, 1, 1] [2018-09-26 08:10:08,124 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:08,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash 915970979, now seen corresponding path program 180 times [2018-09-26 08:10:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:09,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:09,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:10:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:10:09,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:10:09,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16655, Invalid=17017, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:10:09,101 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2018-09-26 08:10:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:11,096 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-09-26 08:10:11,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:10:11,096 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2018-09-26 08:10:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:11,097 INFO L225 Difference]: With dead ends: 370 [2018-09-26 08:10:11,097 INFO L226 Difference]: Without dead ends: 368 [2018-09-26 08:10:11,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 363 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16470 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=49959, Invalid=82901, Unknown=0, NotChecked=0, Total=132860 [2018-09-26 08:10:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-09-26 08:10:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 367. [2018-09-26 08:10:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-09-26 08:10:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-09-26 08:10:11,115 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 364 [2018-09-26 08:10:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:11,115 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-09-26 08:10:11,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:10:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-09-26 08:10:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-09-26 08:10:11,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:11,116 INFO L375 BasicCegarLoop]: trace histogram [182, 181, 1, 1, 1] [2018-09-26 08:10:11,116 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:11,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash -220238163, now seen corresponding path program 181 times [2018-09-26 08:10:11,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:12,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:12,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:10:12,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:10:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:10:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16838, Invalid=17202, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:10:12,142 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 185 states. [2018-09-26 08:10:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:14,037 INFO L93 Difference]: Finished difference Result 372 states and 372 transitions. [2018-09-26 08:10:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:10:14,037 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 366 [2018-09-26 08:10:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:14,038 INFO L225 Difference]: With dead ends: 372 [2018-09-26 08:10:14,038 INFO L226 Difference]: Without dead ends: 370 [2018-09-26 08:10:14,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=50508, Invalid=83814, Unknown=0, NotChecked=0, Total=134322 [2018-09-26 08:10:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-09-26 08:10:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2018-09-26 08:10:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-09-26 08:10:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-09-26 08:10:14,056 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 366 [2018-09-26 08:10:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:14,056 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-09-26 08:10:14,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:10:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-09-26 08:10:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-26 08:10:14,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:14,058 INFO L375 BasicCegarLoop]: trace histogram [183, 182, 1, 1, 1] [2018-09-26 08:10:14,058 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:14,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1195530441, now seen corresponding path program 182 times [2018-09-26 08:10:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:15,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:15,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:10:15,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:10:15,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:10:15,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17022, Invalid=17388, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:10:15,126 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2018-09-26 08:10:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:16,908 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-09-26 08:10:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:10:16,908 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2018-09-26 08:10:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:16,909 INFO L225 Difference]: With dead ends: 374 [2018-09-26 08:10:16,909 INFO L226 Difference]: Without dead ends: 372 [2018-09-26 08:10:16,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16835 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=51060, Invalid=84732, Unknown=0, NotChecked=0, Total=135792 [2018-09-26 08:10:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-09-26 08:10:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-09-26 08:10:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:10:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-09-26 08:10:16,926 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 368 [2018-09-26 08:10:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:16,926 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-09-26 08:10:16,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:10:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-09-26 08:10:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-26 08:10:16,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:16,927 INFO L375 BasicCegarLoop]: trace histogram [184, 183, 1, 1, 1] [2018-09-26 08:10:16,927 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:16,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2146428225, now seen corresponding path program 183 times [2018-09-26 08:10:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:17,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:17,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:10:17,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:10:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:10:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17207, Invalid=17575, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:10:17,820 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 187 states. [2018-09-26 08:10:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:19,514 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2018-09-26 08:10:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:10:19,514 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 370 [2018-09-26 08:10:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:19,514 INFO L225 Difference]: With dead ends: 376 [2018-09-26 08:10:19,515 INFO L226 Difference]: Without dead ends: 374 [2018-09-26 08:10:19,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17019 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=51615, Invalid=85655, Unknown=0, NotChecked=0, Total=137270 [2018-09-26 08:10:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-09-26 08:10:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-09-26 08:10:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-26 08:10:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-09-26 08:10:19,526 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 370 [2018-09-26 08:10:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:19,526 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-09-26 08:10:19,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:10:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-09-26 08:10:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-09-26 08:10:19,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:19,527 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 1, 1, 1] [2018-09-26 08:10:19,527 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:19,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1133168843, now seen corresponding path program 184 times [2018-09-26 08:10:19,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:20,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:20,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:10:20,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:10:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:10:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17393, Invalid=17763, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:10:20,389 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2018-09-26 08:10:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:22,142 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-09-26 08:10:22,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:10:22,143 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2018-09-26 08:10:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:22,143 INFO L225 Difference]: With dead ends: 378 [2018-09-26 08:10:22,143 INFO L226 Difference]: Without dead ends: 376 [2018-09-26 08:10:22,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17204 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=52173, Invalid=86583, Unknown=0, NotChecked=0, Total=138756 [2018-09-26 08:10:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-09-26 08:10:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 375. [2018-09-26 08:10:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-09-26 08:10:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-09-26 08:10:22,158 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 372 [2018-09-26 08:10:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:22,159 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-09-26 08:10:22,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:10:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-09-26 08:10:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-09-26 08:10:22,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:22,160 INFO L375 BasicCegarLoop]: trace histogram [186, 185, 1, 1, 1] [2018-09-26 08:10:22,160 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:22,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1946488363, now seen corresponding path program 185 times [2018-09-26 08:10:22,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:23,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:23,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:10:23,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:10:23,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:10:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17580, Invalid=17952, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:10:23,099 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 189 states. [2018-09-26 08:10:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:24,817 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-09-26 08:10:24,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:10:24,818 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 374 [2018-09-26 08:10:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:24,818 INFO L225 Difference]: With dead ends: 380 [2018-09-26 08:10:24,818 INFO L226 Difference]: Without dead ends: 378 [2018-09-26 08:10:24,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17390 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=52734, Invalid=87516, Unknown=0, NotChecked=0, Total=140250 [2018-09-26 08:10:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-09-26 08:10:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-09-26 08:10:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-09-26 08:10:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-09-26 08:10:24,833 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 374 [2018-09-26 08:10:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:24,834 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-09-26 08:10:24,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:10:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-09-26 08:10:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-09-26 08:10:24,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:24,835 INFO L375 BasicCegarLoop]: trace histogram [187, 186, 1, 1, 1] [2018-09-26 08:10:24,835 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:24,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2030370911, now seen corresponding path program 186 times [2018-09-26 08:10:24,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:25,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:25,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:10:25,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:10:25,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:10:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17768, Invalid=18142, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:10:25,845 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2018-09-26 08:10:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:27,780 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2018-09-26 08:10:27,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:10:27,780 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2018-09-26 08:10:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:27,781 INFO L225 Difference]: With dead ends: 382 [2018-09-26 08:10:27,781 INFO L226 Difference]: Without dead ends: 380 [2018-09-26 08:10:27,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17577 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=53298, Invalid=88454, Unknown=0, NotChecked=0, Total=141752 [2018-09-26 08:10:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-26 08:10:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2018-09-26 08:10:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-09-26 08:10:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-09-26 08:10:27,799 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 376 [2018-09-26 08:10:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:27,800 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-09-26 08:10:27,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:10:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-09-26 08:10:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-26 08:10:27,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:27,802 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 1, 1, 1] [2018-09-26 08:10:27,802 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:27,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1271239785, now seen corresponding path program 187 times [2018-09-26 08:10:27,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:28,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:28,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:10:28,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:10:28,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:10:28,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17957, Invalid=18333, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:10:28,936 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 191 states. [2018-09-26 08:10:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:31,141 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-09-26 08:10:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:10:31,141 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 378 [2018-09-26 08:10:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:31,142 INFO L225 Difference]: With dead ends: 384 [2018-09-26 08:10:31,142 INFO L226 Difference]: Without dead ends: 382 [2018-09-26 08:10:31,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17765 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=53865, Invalid=89397, Unknown=0, NotChecked=0, Total=143262 [2018-09-26 08:10:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-26 08:10:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-09-26 08:10:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:10:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-09-26 08:10:31,155 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 378 [2018-09-26 08:10:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:31,155 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-09-26 08:10:31,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:10:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-09-26 08:10:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-09-26 08:10:31,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:31,156 INFO L375 BasicCegarLoop]: trace histogram [189, 188, 1, 1, 1] [2018-09-26 08:10:31,156 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:31,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:31,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1890668019, now seen corresponding path program 188 times [2018-09-26 08:10:31,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:32,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:32,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:10:32,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:10:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:10:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18147, Invalid=18525, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:10:32,301 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2018-09-26 08:10:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:34,560 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-09-26 08:10:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:10:34,561 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2018-09-26 08:10:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:34,561 INFO L225 Difference]: With dead ends: 386 [2018-09-26 08:10:34,561 INFO L226 Difference]: Without dead ends: 384 [2018-09-26 08:10:34,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17954 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=54435, Invalid=90345, Unknown=0, NotChecked=0, Total=144780 [2018-09-26 08:10:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-09-26 08:10:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 383. [2018-09-26 08:10:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-26 08:10:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-09-26 08:10:34,582 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 380 [2018-09-26 08:10:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,582 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-09-26 08:10:34,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:10:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-09-26 08:10:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-09-26 08:10:34,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,583 INFO L375 BasicCegarLoop]: trace histogram [190, 189, 1, 1, 1] [2018-09-26 08:10:34,584 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 160746749, now seen corresponding path program 189 times [2018-09-26 08:10:34,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:35,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:35,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:10:35,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:10:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:10:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18338, Invalid=18718, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:10:35,837 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 193 states. [2018-09-26 08:10:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,936 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-09-26 08:10:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:10:37,936 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 382 [2018-09-26 08:10:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,937 INFO L225 Difference]: With dead ends: 388 [2018-09-26 08:10:37,938 INFO L226 Difference]: Without dead ends: 386 [2018-09-26 08:10:37,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18144 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=55008, Invalid=91298, Unknown=0, NotChecked=0, Total=146306 [2018-09-26 08:10:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-09-26 08:10:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-09-26 08:10:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-09-26 08:10:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-09-26 08:10:37,959 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 382 [2018-09-26 08:10:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:37,959 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-09-26 08:10:37,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:10:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-09-26 08:10:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-26 08:10:37,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:37,960 INFO L375 BasicCegarLoop]: trace histogram [191, 190, 1, 1, 1] [2018-09-26 08:10:37,960 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:37,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -141250169, now seen corresponding path program 190 times [2018-09-26 08:10:37,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:39,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:39,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:10:39,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:10:39,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:10:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18530, Invalid=18912, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:10:39,105 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2018-09-26 08:10:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:41,055 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-09-26 08:10:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:10:41,055 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2018-09-26 08:10:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:41,056 INFO L225 Difference]: With dead ends: 390 [2018-09-26 08:10:41,056 INFO L226 Difference]: Without dead ends: 388 [2018-09-26 08:10:41,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18335 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=55584, Invalid=92256, Unknown=0, NotChecked=0, Total=147840 [2018-09-26 08:10:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-09-26 08:10:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 387. [2018-09-26 08:10:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 08:10:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-09-26 08:10:41,072 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 384 [2018-09-26 08:10:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:41,073 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-09-26 08:10:41,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:10:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-09-26 08:10:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-26 08:10:41,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:41,075 INFO L375 BasicCegarLoop]: trace histogram [192, 191, 1, 1, 1] [2018-09-26 08:10:41,075 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:41,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1697487761, now seen corresponding path program 191 times [2018-09-26 08:10:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:42,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:42,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:10:42,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:10:42,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:10:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18723, Invalid=19107, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:10:42,272 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 195 states. [2018-09-26 08:10:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:44,347 INFO L93 Difference]: Finished difference Result 392 states and 392 transitions. [2018-09-26 08:10:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:10:44,347 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 386 [2018-09-26 08:10:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:44,348 INFO L225 Difference]: With dead ends: 392 [2018-09-26 08:10:44,348 INFO L226 Difference]: Without dead ends: 390 [2018-09-26 08:10:44,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18527 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=56163, Invalid=93219, Unknown=0, NotChecked=0, Total=149382 [2018-09-26 08:10:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-09-26 08:10:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2018-09-26 08:10:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-09-26 08:10:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-09-26 08:10:44,367 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 386 [2018-09-26 08:10:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:44,367 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-09-26 08:10:44,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:10:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-09-26 08:10:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-26 08:10:44,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:44,369 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 1, 1, 1] [2018-09-26 08:10:44,369 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:44,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash -801887461, now seen corresponding path program 192 times [2018-09-26 08:10:44,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:45,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:45,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:10:45,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:10:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:10:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18917, Invalid=19303, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:10:45,472 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2018-09-26 08:10:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:47,509 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2018-09-26 08:10:47,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:10:47,510 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2018-09-26 08:10:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:47,510 INFO L225 Difference]: With dead ends: 394 [2018-09-26 08:10:47,510 INFO L226 Difference]: Without dead ends: 392 [2018-09-26 08:10:47,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18720 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=56745, Invalid=94187, Unknown=0, NotChecked=0, Total=150932 [2018-09-26 08:10:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-09-26 08:10:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 391. [2018-09-26 08:10:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 08:10:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-09-26 08:10:47,527 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 388 [2018-09-26 08:10:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:47,527 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-09-26 08:10:47,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:10:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-09-26 08:10:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-26 08:10:47,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:47,529 INFO L375 BasicCegarLoop]: trace histogram [194, 193, 1, 1, 1] [2018-09-26 08:10:47,529 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:47,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:47,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1814757339, now seen corresponding path program 193 times [2018-09-26 08:10:47,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:48,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:48,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:10:48,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:10:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:10:48,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19112, Invalid=19500, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:10:48,774 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 197 states. [2018-09-26 08:10:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:51,322 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2018-09-26 08:10:51,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:10:51,322 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 390 [2018-09-26 08:10:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:51,322 INFO L225 Difference]: With dead ends: 396 [2018-09-26 08:10:51,322 INFO L226 Difference]: Without dead ends: 394 [2018-09-26 08:10:51,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18914 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=57330, Invalid=95160, Unknown=0, NotChecked=0, Total=152490 [2018-09-26 08:10:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-09-26 08:10:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-09-26 08:10:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 08:10:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-09-26 08:10:51,335 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 390 [2018-09-26 08:10:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:51,335 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-09-26 08:10:51,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:10:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-09-26 08:10:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-09-26 08:10:51,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:51,337 INFO L375 BasicCegarLoop]: trace histogram [195, 194, 1, 1, 1] [2018-09-26 08:10:51,337 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -225133905, now seen corresponding path program 194 times [2018-09-26 08:10:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:52,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:52,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:10:52,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:10:52,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:10:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19308, Invalid=19698, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:10:52,492 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2018-09-26 08:10:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,960 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-09-26 08:10:54,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:10:54,960 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2018-09-26 08:10:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,961 INFO L225 Difference]: With dead ends: 398 [2018-09-26 08:10:54,961 INFO L226 Difference]: Without dead ends: 396 [2018-09-26 08:10:54,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19109 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=57918, Invalid=96138, Unknown=0, NotChecked=0, Total=154056 [2018-09-26 08:10:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-09-26 08:10:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 395. [2018-09-26 08:10:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 08:10:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-09-26 08:10:54,980 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 392 [2018-09-26 08:10:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,980 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-09-26 08:10:54,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:10:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-09-26 08:10:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-09-26 08:10:54,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,982 INFO L375 BasicCegarLoop]: trace histogram [196, 195, 1, 1, 1] [2018-09-26 08:10:54,982 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1605371207, now seen corresponding path program 195 times [2018-09-26 08:10:54,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:56,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:10:56,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:10:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:10:56,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19505, Invalid=19897, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:10:56,109 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 199 states. [2018-09-26 08:10:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:58,227 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-09-26 08:10:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:10:58,227 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 394 [2018-09-26 08:10:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:58,228 INFO L225 Difference]: With dead ends: 400 [2018-09-26 08:10:58,228 INFO L226 Difference]: Without dead ends: 398 [2018-09-26 08:10:58,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19305 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=58509, Invalid=97121, Unknown=0, NotChecked=0, Total=155630 [2018-09-26 08:10:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-09-26 08:10:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-09-26 08:10:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-26 08:10:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-09-26 08:10:58,245 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 394 [2018-09-26 08:10:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:58,245 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-09-26 08:10:58,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:10:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-09-26 08:10:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-09-26 08:10:58,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:58,247 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 1, 1, 1] [2018-09-26 08:10:58,247 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:58,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash -868523965, now seen corresponding path program 196 times [2018-09-26 08:10:58,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:59,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:59,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:10:59,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:10:59,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:10:59,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19703, Invalid=20097, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:10:59,387 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2018-09-26 08:11:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:01,451 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2018-09-26 08:11:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:11:01,451 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2018-09-26 08:11:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:01,452 INFO L225 Difference]: With dead ends: 402 [2018-09-26 08:11:01,452 INFO L226 Difference]: Without dead ends: 400 [2018-09-26 08:11:01,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19502 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=59103, Invalid=98109, Unknown=0, NotChecked=0, Total=157212 [2018-09-26 08:11:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-09-26 08:11:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 399. [2018-09-26 08:11:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-09-26 08:11:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-09-26 08:11:01,469 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 396 [2018-09-26 08:11:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:01,469 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-09-26 08:11:01,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:11:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-09-26 08:11:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-09-26 08:11:01,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:01,470 INFO L375 BasicCegarLoop]: trace histogram [198, 197, 1, 1, 1] [2018-09-26 08:11:01,470 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:01,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1427928243, now seen corresponding path program 197 times [2018-09-26 08:11:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:02,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:02,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:11:02,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:11:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:11:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19902, Invalid=20298, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:11:02,620 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 201 states. [2018-09-26 08:11:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:04,727 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-09-26 08:11:04,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:11:04,727 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 398 [2018-09-26 08:11:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:04,728 INFO L225 Difference]: With dead ends: 404 [2018-09-26 08:11:04,728 INFO L226 Difference]: Without dead ends: 402 [2018-09-26 08:11:04,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19700 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=59700, Invalid=99102, Unknown=0, NotChecked=0, Total=158802 [2018-09-26 08:11:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-26 08:11:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2018-09-26 08:11:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-09-26 08:11:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-09-26 08:11:04,744 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 398 [2018-09-26 08:11:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:04,744 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-09-26 08:11:04,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:11:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-09-26 08:11:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-09-26 08:11:04,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:04,746 INFO L375 BasicCegarLoop]: trace histogram [199, 198, 1, 1, 1] [2018-09-26 08:11:04,746 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:04,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2144527401, now seen corresponding path program 198 times [2018-09-26 08:11:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:05,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:05,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:11:05,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:11:05,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:11:05,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20102, Invalid=20500, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:11:05,835 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2018-09-26 08:11:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:07,792 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2018-09-26 08:11:07,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:11:07,792 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2018-09-26 08:11:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:07,793 INFO L225 Difference]: With dead ends: 406 [2018-09-26 08:11:07,793 INFO L226 Difference]: Without dead ends: 404 [2018-09-26 08:11:07,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19899 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60300, Invalid=100100, Unknown=0, NotChecked=0, Total=160400 [2018-09-26 08:11:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-09-26 08:11:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 403. [2018-09-26 08:11:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 08:11:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-09-26 08:11:07,808 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 400 [2018-09-26 08:11:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:07,808 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-09-26 08:11:07,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:11:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-09-26 08:11:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-26 08:11:07,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:07,810 INFO L375 BasicCegarLoop]: trace histogram [200, 199, 1, 1, 1] [2018-09-26 08:11:07,810 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 693416417, now seen corresponding path program 199 times [2018-09-26 08:11:07,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:08,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:08,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-09-26 08:11:08,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-09-26 08:11:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-09-26 08:11:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20303, Invalid=20703, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:11:08,899 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 203 states. [2018-09-26 08:11:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:10,971 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-09-26 08:11:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:11:10,971 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 402 [2018-09-26 08:11:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:10,972 INFO L225 Difference]: With dead ends: 408 [2018-09-26 08:11:10,972 INFO L226 Difference]: Without dead ends: 406 [2018-09-26 08:11:10,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20099 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60903, Invalid=101103, Unknown=0, NotChecked=0, Total=162006 [2018-09-26 08:11:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-26 08:11:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2018-09-26 08:11:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-09-26 08:11:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-09-26 08:11:10,986 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 402 [2018-09-26 08:11:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:10,986 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-09-26 08:11:10,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-09-26 08:11:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-09-26 08:11:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-09-26 08:11:10,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:10,987 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 1, 1, 1] [2018-09-26 08:11:10,987 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:10,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 653192555, now seen corresponding path program 200 times [2018-09-26 08:11:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:12,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:12,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:11:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:11:12,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:11:12,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20505, Invalid=20907, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:11:12,071 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 204 states. [2018-09-26 08:11:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:14,470 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-09-26 08:11:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:11:14,470 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 404 [2018-09-26 08:11:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:14,471 INFO L225 Difference]: With dead ends: 410 [2018-09-26 08:11:14,471 INFO L226 Difference]: Without dead ends: 408 [2018-09-26 08:11:14,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20300 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=61509, Invalid=102111, Unknown=0, NotChecked=0, Total=163620 [2018-09-26 08:11:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-09-26 08:11:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 407. [2018-09-26 08:11:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-09-26 08:11:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-09-26 08:11:14,484 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 404 [2018-09-26 08:11:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:14,484 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-09-26 08:11:14,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:11:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-09-26 08:11:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-09-26 08:11:14,486 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:14,487 INFO L375 BasicCegarLoop]: trace histogram [202, 201, 1, 1, 1] [2018-09-26 08:11:14,487 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:14,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash 652766837, now seen corresponding path program 201 times [2018-09-26 08:11:14,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:15,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:15,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:11:15,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:11:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:11:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20708, Invalid=21112, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:11:15,590 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 205 states. [2018-09-26 08:11:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:17,918 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-09-26 08:11:17,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:11:17,918 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 406 [2018-09-26 08:11:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:17,919 INFO L225 Difference]: With dead ends: 412 [2018-09-26 08:11:17,919 INFO L226 Difference]: Without dead ends: 410 [2018-09-26 08:11:17,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20502 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=62118, Invalid=103124, Unknown=0, NotChecked=0, Total=165242 [2018-09-26 08:11:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-09-26 08:11:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 409. [2018-09-26 08:11:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 08:11:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2018-09-26 08:11:17,930 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 406 [2018-09-26 08:11:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:17,931 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2018-09-26 08:11:17,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:11:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2018-09-26 08:11:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-09-26 08:11:17,932 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:17,932 INFO L375 BasicCegarLoop]: trace histogram [203, 202, 1, 1, 1] [2018-09-26 08:11:17,932 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:17,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 243651839, now seen corresponding path program 202 times [2018-09-26 08:11:17,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:19,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:19,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:11:19,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:11:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:11:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20912, Invalid=21318, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:11:19,047 INFO L87 Difference]: Start difference. First operand 409 states and 409 transitions. Second operand 206 states. [2018-09-26 08:11:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:21,377 INFO L93 Difference]: Finished difference Result 414 states and 414 transitions. [2018-09-26 08:11:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:11:21,378 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 408 [2018-09-26 08:11:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:21,378 INFO L225 Difference]: With dead ends: 414 [2018-09-26 08:11:21,378 INFO L226 Difference]: Without dead ends: 412 [2018-09-26 08:11:21,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20705 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=62730, Invalid=104142, Unknown=0, NotChecked=0, Total=166872 [2018-09-26 08:11:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-09-26 08:11:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 411. [2018-09-26 08:11:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:11:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-09-26 08:11:21,398 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 408 [2018-09-26 08:11:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:21,398 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-09-26 08:11:21,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:11:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-09-26 08:11:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-26 08:11:21,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:21,400 INFO L375 BasicCegarLoop]: trace histogram [204, 203, 1, 1, 1] [2018-09-26 08:11:21,400 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:21,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2073837303, now seen corresponding path program 203 times [2018-09-26 08:11:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:22,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:22,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-09-26 08:11:22,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-09-26 08:11:22,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-09-26 08:11:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21117, Invalid=21525, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:11:22,626 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 207 states. Received shutdown request... [2018-09-26 08:11:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:11:23,857 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:11:23,861 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:11:23,862 INFO L202 PluginConnector]: Adding new model count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:11:23 BoogieIcfgContainer [2018-09-26 08:11:23,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:11:23,863 INFO L168 Benchmark]: Toolchain (without parser) took 258083.32 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -69.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-09-26 08:11:23,865 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:11:23,865 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:11:23,865 INFO L168 Benchmark]: Boogie Preprocessor took 23.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:11:23,871 INFO L168 Benchmark]: RCFGBuilder took 240.92 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-09-26 08:11:23,871 INFO L168 Benchmark]: TraceAbstraction took 257766.36 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -80.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-09-26 08:11:23,879 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.24 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 45.41 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 23.01 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 240.92 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 257766.36 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -80.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (411states) and FLOYD_HOARE automaton (currently 152 states, 207 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 356 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 257.6s OverallTime, 204 OverallIterations, 204 TraceHistogramMax, 163.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 611 SDtfs, 204 SDslu, 17777 SDs, 0 SdLazy, 42929 SolverSat, 41966 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42174 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 41969 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1425958 ImplicationChecksByTransitivity, 189.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=203, 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: 1.6s AutomataMinimizationTime, 203 MinimizatonAttempts, 203 StatesRemovedByMinimization, 203 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 7.7s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 42228 NumberOfCodeBlocks, 42228 NumberOfCodeBlocksAsserted, 204 NumberOfCheckSat, 42024 ConstructedInterpolants, 0 QuantifiedInterpolants, 34376244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 204 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2829820 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_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-11-23-891.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-11-23-891.csv Completed graceful shutdown