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/20170304-DifficultPathPrograms/down.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:15:09,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:15:09,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:15:09,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:15:09,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:15:09,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:15:09,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:15:09,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:15:09,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:15:09,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:15:09,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:15:09,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:15:09,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:15:09,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:15:09,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:15:09,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:15:09,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:15:09,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:15:09,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:15:09,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:15:09,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:15:09,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:15:09,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:15:09,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:15:09,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:15:09,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:15:09,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:15:09,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:15:09,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:15:09,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:15:09,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:15:09,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:15:09,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:15:09,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:15:09,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:15:09,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:15:09,429 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:15:09,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:15:09,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:15:09,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:15:09,442 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:15:09,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:15:09,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:15:09,443 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:15:09,443 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:15:09,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:15:09,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:15:09,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:15:09,546 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:15:09,547 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:15:09,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl [2018-09-26 08:15:09,548 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/down.i_4.bpl' [2018-09-26 08:15:09,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:15:09,619 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:15:09,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:15:09,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:15:09,621 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:15:09,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:15:09,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:15:09,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:15:09,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:15:09,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:15:09,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:15:09,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:15:09,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:15:09,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/1) ... [2018-09-26 08:15:09,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:15:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:15:09,978 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:15:09,978 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:15:09 BoogieIcfgContainer [2018-09-26 08:15:09,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:15:09,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:15:09,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:15:09,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:15:09,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:09" (1/2) ... [2018-09-26 08:15:09,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5fc514 and model type down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:15:09, skipping insertion in model container [2018-09-26 08:15:09,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:15:09" (2/2) ... [2018-09-26 08:15:09,989 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bpl [2018-09-26 08:15:10,000 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:15:10,009 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:15:10,064 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:15:10,065 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:15:10,066 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:15:10,066 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:15:10,066 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:15:10,066 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:15:10,067 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:15:10,067 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:15:10,067 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:15:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:15:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:15:10,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:10,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:15:10,109 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:10,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash 889539593, now seen corresponding path program 1 times [2018-09-26 08:15:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:10,220 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:15:10,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:15:10,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:15:10,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:15:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:15:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:15:10,244 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-09-26 08:15:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:10,293 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-26 08:15:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:15:10,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:15:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:10,307 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:15:10,307 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:15:10,311 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:15:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:15:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:15:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:15:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:15:10,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-26 08:15:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:10,355 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:15:10,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:15:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:15:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:15:10,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:10,356 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:15:10,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:10,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash 198622019, now seen corresponding path program 1 times [2018-09-26 08:15:10,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:10,399 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:15:10,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:15:10,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:15:10,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:15:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:15:10,403 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-26 08:15:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:10,454 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 08:15:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:15:10,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:15:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:10,460 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:15:10,461 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:15:10,462 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:15:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:15:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-09-26 08:15:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:15:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:15:10,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 08:15:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:10,471 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:15:10,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:15:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:15:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:15:10,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:10,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:15:10,473 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:10,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1897132479, now seen corresponding path program 1 times [2018-09-26 08:15:10,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:10,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:10,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:15:10,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:15:10,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:15:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:15:10,562 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-09-26 08:15:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:10,612 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-09-26 08:15:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:15:10,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:15:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:10,614 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:15:10,614 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:15:10,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:15:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:15:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:15:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:15:10,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 08:15:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:10,621 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:15:10,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:15:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:15:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:15:10,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:10,622 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:15:10,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:10,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1765329927, now seen corresponding path program 2 times [2018-09-26 08:15:10,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:10,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:10,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:15:10,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:15:10,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:15:10,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:15:10,684 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-09-26 08:15:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:10,791 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-26 08:15:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:15:10,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:15:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:10,792 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:15:10,792 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:15:10,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:15:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:15:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-09-26 08:15:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:15:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:15:10,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 08:15:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:10,800 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:15:10,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:15:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:15:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:15:10,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:10,801 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:15:10,802 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:10,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 29955317, now seen corresponding path program 3 times [2018-09-26 08:15:10,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:10,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:10,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:15:10,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:15:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:15:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:10,853 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-09-26 08:15:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:10,912 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-09-26 08:15:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:15:10,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:15:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:10,914 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:15:10,914 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:15:10,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:15:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:15:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:15:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:15:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 08:15:10,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-26 08:15:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:10,922 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 08:15:10,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:15:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 08:15:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:15:10,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:10,923 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-26 08:15:10,923 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:10,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1153652177, now seen corresponding path program 4 times [2018-09-26 08:15:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:15:11,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:15:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:15:11,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:11,005 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-09-26 08:15:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:11,087 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-09-26 08:15:11,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:15:11,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 08:15:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:11,088 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:15:11,088 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:15:11,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:15:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:15:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-09-26 08:15:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:15:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:15:11,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-26 08:15:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:11,098 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:15:11,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:15:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:15:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:15:11,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:11,099 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-26 08:15:11,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:11,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -558246485, now seen corresponding path program 5 times [2018-09-26 08:15:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:15:11,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:15:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:15:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:15:11,181 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-09-26 08:15:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:11,252 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-09-26 08:15:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:15:11,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:15:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:11,257 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:15:11,257 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:15:11,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:15:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:15:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:15:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:15:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:15:11,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-09-26 08:15:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:11,273 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:15:11,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:15:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:15:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:15:11,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:11,278 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-09-26 08:15:11,278 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:11,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash -578011675, now seen corresponding path program 6 times [2018-09-26 08:15:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:15:11,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:15:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:15:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:15:11,354 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2018-09-26 08:15:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:11,420 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-26 08:15:11,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:15:11,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-09-26 08:15:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:11,422 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:15:11,422 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:15:11,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:15:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:15:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-09-26 08:15:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:15:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:15:11,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-09-26 08:15:11,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:11,431 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:15:11,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:15:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:15:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:15:11,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:11,432 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-26 08:15:11,433 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:11,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1418505247, now seen corresponding path program 7 times [2018-09-26 08:15:11,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:15:11,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:15:11,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:15:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:15:11,511 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-09-26 08:15:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:11,569 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-09-26 08:15:11,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:15:11,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-26 08:15:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:11,570 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:15:11,570 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:15:11,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:15:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:15:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:15:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:15:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:15:11,583 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-26 08:15:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:11,584 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:15:11,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:15:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:15:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:15:11,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:11,586 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-26 08:15:11,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:11,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1375531237, now seen corresponding path program 8 times [2018-09-26 08:15:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:15:11,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:15:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:15:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:15:11,631 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2018-09-26 08:15:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:11,698 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-26 08:15:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:15:11,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-09-26 08:15:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:11,699 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:15:11,700 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:15:11,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:15:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:15:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-09-26 08:15:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:15:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:15:11,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 08:15:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:11,710 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:15:11,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:15:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:15:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:15:11,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:11,712 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-26 08:15:11,712 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:11,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash 964341655, now seen corresponding path program 9 times [2018-09-26 08:15:11,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:15:11,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:15:11,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:15:11,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:15:11,762 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-09-26 08:15:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:11,847 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-09-26 08:15:11,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:15:11,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 08:15:11,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:11,855 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:15:11,855 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:15:11,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:15:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:15:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:15:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:15:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 08:15:11,868 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-26 08:15:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:11,869 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 08:15:11,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:15:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 08:15:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:15:11,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:11,871 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-26 08:15:11,871 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:11,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:11,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1427751471, now seen corresponding path program 10 times [2018-09-26 08:15:11,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:15:11,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:15:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:15:11,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:15:11,953 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2018-09-26 08:15:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,039 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-09-26 08:15:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:15:12,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-09-26 08:15:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,041 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:15:12,041 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:15:12,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:15:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:15:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-09-26 08:15:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:15:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:15:12,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-26 08:15:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,062 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:15:12,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:15:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:15:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:15:12,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,065 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-26 08:15:12,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1974662963, now seen corresponding path program 11 times [2018-09-26 08:15:12,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:12,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:12,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:15:12,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:15:12,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:15:12,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:15:12,146 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-09-26 08:15:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,232 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-09-26 08:15:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:15:12,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 08:15:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,238 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:15:12,238 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:15:12,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:15:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:15:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:15:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:15:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-09-26 08:15:12,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-09-26 08:15:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,256 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-09-26 08:15:12,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:15:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-09-26 08:15:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:15:12,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,265 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2018-09-26 08:15:12,266 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash 577956359, now seen corresponding path program 12 times [2018-09-26 08:15:12,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:12,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:12,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:15:12,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:15:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:15:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:15:12,345 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 12 states. [2018-09-26 08:15:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,412 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-09-26 08:15:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:15:12,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-09-26 08:15:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,414 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:15:12,414 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:15:12,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:15:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:15:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-09-26 08:15:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:15:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:15:12,427 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-09-26 08:15:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,428 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:15:12,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:15:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:15:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:15:12,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,429 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-26 08:15:12,430 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1365213059, now seen corresponding path program 13 times [2018-09-26 08:15:12,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:12,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:12,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:15:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:15:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:15:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:15:12,504 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-09-26 08:15:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,601 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-09-26 08:15:12,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:15:12,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-26 08:15:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,606 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:15:12,607 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:15:12,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:15:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:15:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:15:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:15:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-09-26 08:15:12,625 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-09-26 08:15:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,627 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-09-26 08:15:12,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:15:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-09-26 08:15:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:15:12,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,628 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2018-09-26 08:15:12,629 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1260506179, now seen corresponding path program 14 times [2018-09-26 08:15:12,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:12,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:12,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:15:12,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:15:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:15:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:15:12,704 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-09-26 08:15:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,780 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-26 08:15:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:15:12,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-09-26 08:15:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,781 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:15:12,781 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:15:12,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:15:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:15:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-09-26 08:15:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:15:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:15:12,801 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-09-26 08:15:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,802 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:15:12,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:15:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:15:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:15:12,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,803 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-26 08:15:12,803 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash -165727303, now seen corresponding path program 15 times [2018-09-26 08:15:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:12,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:12,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:15:12,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:15:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:15:12,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:15:12,894 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-09-26 08:15:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,995 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-09-26 08:15:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:15:12,995 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-09-26 08:15:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,996 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:15:12,996 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:15:12,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:15:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:15:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:15:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:15:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-26 08:15:13,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-26 08:15:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:13,008 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-26 08:15:13,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:15:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-26 08:15:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:15:13,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:13,009 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-26 08:15:13,009 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:13,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1448426227, now seen corresponding path program 16 times [2018-09-26 08:15:13,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:13,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:13,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:15:13,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:15:13,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:15:13,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:15:13,072 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 14 states. [2018-09-26 08:15:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:13,148 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-26 08:15:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:15:13,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-09-26 08:15:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:13,150 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:15:13,150 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:15:13,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:15:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:15:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-09-26 08:15:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:15:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:15:13,160 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-26 08:15:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:13,161 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:15:13,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:15:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:15:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:15:13,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:13,162 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-26 08:15:13,162 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:13,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash 368133487, now seen corresponding path program 17 times [2018-09-26 08:15:13,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:13,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:13,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:15:13,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:15:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:15:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:15:13,237 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-09-26 08:15:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:13,355 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-09-26 08:15:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:15:13,355 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-09-26 08:15:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:13,356 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:15:13,356 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:15:13,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:15:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:15:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:15:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:15:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 08:15:13,372 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-26 08:15:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:13,372 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 08:15:13,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:15:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 08:15:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:15:13,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:13,378 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-26 08:15:13,378 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:13,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash -788717655, now seen corresponding path program 18 times [2018-09-26 08:15:13,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:13,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:13,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:15:13,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:15:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:15:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:15:13,453 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-09-26 08:15:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:13,529 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-09-26 08:15:13,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:15:13,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-09-26 08:15:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:13,530 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:15:13,530 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:15:13,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:15:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:15:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-09-26 08:15:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:15:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 08:15:13,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-26 08:15:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:13,547 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 08:15:13,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:15:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 08:15:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:15:13,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:13,549 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-26 08:15:13,549 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:13,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2043489115, now seen corresponding path program 19 times [2018-09-26 08:15:13,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 110 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:13,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:13,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:15:13,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:15:13,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:15:13,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:15:13,652 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-09-26 08:15:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:13,777 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-09-26 08:15:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:15:13,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-09-26 08:15:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:13,778 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:15:13,778 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:15:13,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:15:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:15:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:15:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:15:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-09-26 08:15:13,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-09-26 08:15:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-09-26 08:15:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:15:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-09-26 08:15:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:15:13,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:13,793 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2018-09-26 08:15:13,796 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:13,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash -957152801, now seen corresponding path program 20 times [2018-09-26 08:15:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:13,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:13,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:15:13,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:15:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:15:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:15:13,872 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 16 states. [2018-09-26 08:15:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:13,958 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-09-26 08:15:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:15:13,959 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-09-26 08:15:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:13,960 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:15:13,960 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:15:13,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=288, Invalid=468, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:15:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:15:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-09-26 08:15:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:15:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:15:13,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-09-26 08:15:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:13,987 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:15:13,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:15:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:15:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:15:13,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:13,992 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-26 08:15:13,993 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:13,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash -700907173, now seen corresponding path program 21 times [2018-09-26 08:15:13,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:14,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:14,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:15:14,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:15:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:15:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:15:14,093 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-09-26 08:15:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:14,228 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-09-26 08:15:14,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:15:14,229 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-09-26 08:15:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:14,230 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:15:14,230 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:15:14,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:15:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:15:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:15:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:15:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-09-26 08:15:14,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-09-26 08:15:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:14,244 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-09-26 08:15:14,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:15:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-09-26 08:15:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:15:14,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:14,246 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2018-09-26 08:15:14,246 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:14,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 877396373, now seen corresponding path program 22 times [2018-09-26 08:15:14,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:14,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:14,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:15:14,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:15:14,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:15:14,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:15:14,335 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 17 states. [2018-09-26 08:15:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:14,440 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-09-26 08:15:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:15:14,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-09-26 08:15:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:14,441 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:15:14,441 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:15:14,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=331, Invalid=539, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:15:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:15:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-09-26 08:15:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:15:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:15:14,455 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-09-26 08:15:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:14,456 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:15:14,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:15:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:15:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:15:14,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:14,459 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-26 08:15:14,459 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:14,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:14,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1364257681, now seen corresponding path program 23 times [2018-09-26 08:15:14,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 156 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:14,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:14,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:15:14,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:15:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:15:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:15:14,640 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-09-26 08:15:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:14,801 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-09-26 08:15:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:15:14,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-09-26 08:15:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:14,802 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:15:14,802 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:15:14,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:15:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:15:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:15:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:15:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-26 08:15:14,817 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-09-26 08:15:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:14,817 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-26 08:15:14,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:15:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-26 08:15:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:15:14,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:14,818 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2018-09-26 08:15:14,819 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:14,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1897217739, now seen corresponding path program 24 times [2018-09-26 08:15:14,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:14,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:14,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:15:14,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:15:14,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:15:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:15:14,905 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 18 states. [2018-09-26 08:15:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:15,004 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-26 08:15:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:15:15,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-09-26 08:15:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:15,005 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:15:15,005 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:15:15,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=377, Invalid=615, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:15:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:15:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-09-26 08:15:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:15:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:15:15,022 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-09-26 08:15:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:15,023 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:15:15,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:15:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:15:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:15:15,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:15,024 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-26 08:15:15,024 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:15,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2134920377, now seen corresponding path program 25 times [2018-09-26 08:15:15,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:15,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:15,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:15:15,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:15:15,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:15:15,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:15:15,130 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-09-26 08:15:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:15,307 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-09-26 08:15:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:15:15,308 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-09-26 08:15:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:15,309 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:15:15,309 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:15:15,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:15:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:15:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:15:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:15:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 08:15:15,323 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-26 08:15:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:15,324 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 08:15:15,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:15:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 08:15:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:15:15,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:15,325 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-26 08:15:15,325 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:15,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1286350463, now seen corresponding path program 26 times [2018-09-26 08:15:15,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:15,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:15,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:15:15,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:15:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:15:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:15:15,405 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 19 states. [2018-09-26 08:15:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:15,495 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-09-26 08:15:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:15:15,496 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-09-26 08:15:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:15,496 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:15:15,496 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:15:15,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=426, Invalid=696, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:15:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:15:15,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-09-26 08:15:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:15:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:15:15,511 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-26 08:15:15,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:15,511 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:15:15,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:15:15,511 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:15:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:15:15,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:15,512 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-26 08:15:15,512 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:15,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:15,513 INFO L82 PathProgramCache]: Analyzing trace with hash 767719549, now seen corresponding path program 27 times [2018-09-26 08:15:15,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 210 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:15,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:15,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:15:15,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:15:15,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:15:15,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:15:15,615 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-09-26 08:15:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:15,774 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-09-26 08:15:15,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:15:15,774 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-26 08:15:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:15,775 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:15:15,775 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:15:15,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:15:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:15:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:15:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:15:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-26 08:15:15,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-09-26 08:15:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:15,791 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-26 08:15:15,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:15:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-26 08:15:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:15:15,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:15,791 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2018-09-26 08:15:15,792 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:15,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 285536695, now seen corresponding path program 28 times [2018-09-26 08:15:15,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:15,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:15,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:15:15,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:15:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:15:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:15:15,870 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 20 states. [2018-09-26 08:15:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:15,963 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-09-26 08:15:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:15:15,963 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-09-26 08:15:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:15,964 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:15:15,964 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:15:15,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=478, Invalid=782, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:15:15,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:15:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-09-26 08:15:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:15:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:15:15,982 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-09-26 08:15:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:15,982 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:15:15,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:15:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:15:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:15:15,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:15,983 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-26 08:15:15,984 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:15,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:15,984 INFO L82 PathProgramCache]: Analyzing trace with hash -477209805, now seen corresponding path program 29 times [2018-09-26 08:15:15,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:16,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:16,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:15:16,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:15:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:15:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:15:16,100 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-09-26 08:15:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:16,287 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-09-26 08:15:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:15:16,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-09-26 08:15:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:16,288 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:15:16,288 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:15:16,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:15:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:15:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:15:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:15:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-09-26 08:15:16,305 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-09-26 08:15:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:16,306 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-09-26 08:15:16,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:15:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-09-26 08:15:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:15:16,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:16,307 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2018-09-26 08:15:16,307 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:16,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash 35497837, now seen corresponding path program 30 times [2018-09-26 08:15:16,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:16,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:16,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:15:16,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:15:16,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:15:16,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:15:16,400 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 21 states. [2018-09-26 08:15:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:16,509 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-09-26 08:15:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:15:16,509 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-09-26 08:15:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:16,510 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:15:16,510 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:15:16,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=533, Invalid=873, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:15:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:15:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-09-26 08:15:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:15:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 08:15:16,530 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-09-26 08:15:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:16,530 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 08:15:16,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:15:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 08:15:16,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:15:16,532 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:16,533 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-26 08:15:16,533 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:16,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash -246383767, now seen corresponding path program 31 times [2018-09-26 08:15:16,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:16,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:16,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:15:16,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:15:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:15:16,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:15:16,651 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-09-26 08:15:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:16,845 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-09-26 08:15:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:15:16,845 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-09-26 08:15:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:16,846 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:15:16,846 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:15:16,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:15:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:15:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:15:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:15:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-26 08:15:16,867 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-09-26 08:15:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:16,868 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-26 08:15:16,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:15:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-26 08:15:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:15:16,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:16,869 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2018-09-26 08:15:16,869 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:16,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:16,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1653283491, now seen corresponding path program 32 times [2018-09-26 08:15:16,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:16,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:16,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:15:16,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:15:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:15:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:15:16,968 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 22 states. [2018-09-26 08:15:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:17,074 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-26 08:15:17,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:15:17,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-09-26 08:15:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:17,075 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:15:17,075 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:15:17,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=591, Invalid=969, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:15:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:15:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-09-26 08:15:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:15:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:15:17,099 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-09-26 08:15:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:17,100 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:15:17,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:15:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:15:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:15:17,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:17,101 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-26 08:15:17,101 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:17,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -332531425, now seen corresponding path program 33 times [2018-09-26 08:15:17,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:17,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:17,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:15:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:15:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:15:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:15:17,276 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-09-26 08:15:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:17,560 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-09-26 08:15:17,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:15:17,561 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-09-26 08:15:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:17,562 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:15:17,562 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:15:17,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:15:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:15:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:15:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:15:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-26 08:15:17,588 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-26 08:15:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:17,588 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-26 08:15:17,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:15:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-26 08:15:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:15:17,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:17,589 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-26 08:15:17,590 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:17,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash -198022311, now seen corresponding path program 34 times [2018-09-26 08:15:17,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:17,763 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:17,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:15:17,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:15:17,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:15:17,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:15:17,765 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 23 states. [2018-09-26 08:15:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:17,884 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-26 08:15:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:15:17,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 76 [2018-09-26 08:15:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:17,885 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:15:17,885 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:15:17,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=652, Invalid=1070, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:15:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:15:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-09-26 08:15:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:15:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:15:17,906 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-26 08:15:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:17,907 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:15:17,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:15:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:15:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:15:17,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:17,908 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-26 08:15:17,908 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:17,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1320946603, now seen corresponding path program 35 times [2018-09-26 08:15:17,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 342 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:18,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:18,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:15:18,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:15:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:15:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:15:18,053 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-09-26 08:15:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:18,298 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-09-26 08:15:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:15:18,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-09-26 08:15:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:18,299 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:15:18,299 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:15:18,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:15:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:15:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:15:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:15:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 08:15:18,324 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-26 08:15:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:18,324 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 08:15:18,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:15:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 08:15:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:15:18,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:18,325 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-26 08:15:18,326 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:18,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1626388879, now seen corresponding path program 36 times [2018-09-26 08:15:18,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:18,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:18,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:15:18,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:15:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:15:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:15:18,429 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 24 states. [2018-09-26 08:15:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:18,552 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-09-26 08:15:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:15:18,552 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-09-26 08:15:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:18,553 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:15:18,553 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:15:18,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=716, Invalid=1176, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:15:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:15:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-09-26 08:15:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:15:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:15:18,581 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-26 08:15:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:18,581 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:15:18,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:15:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:15:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:15:18,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:18,582 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-26 08:15:18,583 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:18,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:18,583 INFO L82 PathProgramCache]: Analyzing trace with hash -408449781, now seen corresponding path program 37 times [2018-09-26 08:15:18,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:18,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:18,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:15:18,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:15:18,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:15:18,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:15:18,736 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-09-26 08:15:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:19,014 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-09-26 08:15:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:15:19,014 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-09-26 08:15:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:19,015 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:15:19,015 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:15:19,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:15:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:15:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:15:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:15:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-09-26 08:15:19,039 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-09-26 08:15:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:19,039 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-09-26 08:15:19,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:15:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-09-26 08:15:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:15:19,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:19,040 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2018-09-26 08:15:19,040 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:19,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1130683067, now seen corresponding path program 38 times [2018-09-26 08:15:19,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:19,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:19,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:15:19,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:15:19,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:15:19,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:15:19,150 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 25 states. [2018-09-26 08:15:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:19,296 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-09-26 08:15:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:15:19,296 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-09-26 08:15:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:19,297 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:15:19,297 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:15:19,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=783, Invalid=1287, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:15:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:15:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-09-26 08:15:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:15:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:15:19,322 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-09-26 08:15:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:19,322 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:15:19,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:15:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:15:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:15:19,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:19,323 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-26 08:15:19,324 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:19,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash 40231745, now seen corresponding path program 39 times [2018-09-26 08:15:19,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:19,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:19,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:15:19,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:15:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:15:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:15:19,479 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-09-26 08:15:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:19,678 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-09-26 08:15:19,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:15:19,679 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-09-26 08:15:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:19,680 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:15:19,680 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:15:19,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:15:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:15:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:15:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:15:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-09-26 08:15:19,708 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-09-26 08:15:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:19,708 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-09-26 08:15:19,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:15:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-09-26 08:15:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:15:19,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:19,709 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2018-09-26 08:15:19,710 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:19,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2030121349, now seen corresponding path program 40 times [2018-09-26 08:15:19,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:19,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:19,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:15:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:15:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:15:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:15:19,830 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 26 states. [2018-09-26 08:15:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:19,961 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-26 08:15:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:15:19,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 88 [2018-09-26 08:15:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:19,962 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:15:19,962 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:15:19,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:15:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:15:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-09-26 08:15:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:15:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:15:19,988 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-09-26 08:15:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:19,988 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:15:19,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:15:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:15:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:15:19,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:19,989 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-26 08:15:19,990 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:19,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1031530761, now seen corresponding path program 41 times [2018-09-26 08:15:19,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:20,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:20,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:15:20,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:15:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:15:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:15:20,151 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-09-26 08:15:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:20,477 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-09-26 08:15:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:15:20,477 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-09-26 08:15:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:20,478 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:15:20,478 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:15:20,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:15:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:15:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:15:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:15:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 08:15:20,517 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-26 08:15:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:20,517 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 08:15:20,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:15:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 08:15:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:15:20,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:20,519 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-26 08:15:20,520 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:20,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash 769709361, now seen corresponding path program 42 times [2018-09-26 08:15:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:20,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:20,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:15:20,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:15:20,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:15:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:15:20,668 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 27 states. [2018-09-26 08:15:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:20,826 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-26 08:15:20,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:15:20,827 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 92 [2018-09-26 08:15:20,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:20,828 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:15:20,828 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:15:20,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=926, Invalid=1524, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:15:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:15:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-09-26 08:15:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:15:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 08:15:20,857 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-26 08:15:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:20,858 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 08:15:20,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:15:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 08:15:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:15:20,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:20,892 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-26 08:15:20,892 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:20,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 956254253, now seen corresponding path program 43 times [2018-09-26 08:15:20,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 506 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:21,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:21,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:15:21,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:15:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:15:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:15:21,066 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-09-26 08:15:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:21,376 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-09-26 08:15:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:15:21,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-09-26 08:15:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:21,378 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:15:21,378 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:15:21,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:15:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:15:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:15:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:15:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 08:15:21,407 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-26 08:15:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:21,407 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 08:15:21,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:15:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 08:15:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:15:21,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:21,409 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-26 08:15:21,409 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:21,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 251550055, now seen corresponding path program 44 times [2018-09-26 08:15:21,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:21,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:21,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:15:21,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:15:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:15:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:15:21,525 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 28 states. [2018-09-26 08:15:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:21,658 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-09-26 08:15:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:15:21,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 96 [2018-09-26 08:15:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:21,659 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:15:21,659 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:15:21,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1002, Invalid=1650, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:15:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:15:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-09-26 08:15:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:15:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:15:21,686 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-26 08:15:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:21,687 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:15:21,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:15:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:15:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:15:21,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:21,688 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-26 08:15:21,688 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:21,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1221367523, now seen corresponding path program 45 times [2018-09-26 08:15:21,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:21,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:21,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:15:21,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:15:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:15:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:15:21,849 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-09-26 08:15:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:22,183 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-09-26 08:15:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:15:22,183 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-09-26 08:15:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:22,184 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:15:22,184 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:15:22,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:15:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:15:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:15:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:15:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-09-26 08:15:22,214 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-09-26 08:15:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:22,215 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-09-26 08:15:22,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:15:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-09-26 08:15:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:15:22,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:22,216 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2018-09-26 08:15:22,216 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:22,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash -99845347, now seen corresponding path program 46 times [2018-09-26 08:15:22,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:22,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:22,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:15:22,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:15:22,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:15:22,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:15:22,334 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 29 states. [2018-09-26 08:15:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:22,484 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-09-26 08:15:22,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:15:22,484 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2018-09-26 08:15:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:22,485 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:15:22,485 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:15:22,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1781, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:15:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:15:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2018-09-26 08:15:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:15:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:15:22,519 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-09-26 08:15:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:22,519 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:15:22,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:15:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:15:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:15:22,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:22,520 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-26 08:15:22,521 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:22,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1462164711, now seen corresponding path program 47 times [2018-09-26 08:15:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 600 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:22,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:22,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:15:22,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:15:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:15:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:15:22,694 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-09-26 08:15:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:22,999 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-09-26 08:15:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:15:22,999 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-09-26 08:15:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:23,000 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:15:23,000 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:15:23,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:15:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:15:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:15:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:15:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-09-26 08:15:23,032 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-09-26 08:15:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:23,032 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-09-26 08:15:23,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:15:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-09-26 08:15:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:15:23,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:23,033 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2018-09-26 08:15:23,034 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:23,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 850942547, now seen corresponding path program 48 times [2018-09-26 08:15:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:23,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:23,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:15:23,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:15:23,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:15:23,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:15:23,151 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 30 states. [2018-09-26 08:15:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:23,307 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-26 08:15:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:15:23,307 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2018-09-26 08:15:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:23,309 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:15:23,309 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:15:23,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1163, Invalid=1917, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:15:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:15:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-09-26 08:15:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:15:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:15:23,341 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-09-26 08:15:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:23,341 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:15:23,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:15:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:15:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:15:23,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:23,343 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-26 08:15:23,343 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:23,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:23,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1711934671, now seen corresponding path program 49 times [2018-09-26 08:15:23,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:23,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:23,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:15:23,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:15:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:15:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:15:23,515 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-09-26 08:15:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:23,856 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-09-26 08:15:23,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:15:23,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-09-26 08:15:23,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:23,857 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:15:23,858 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:15:23,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:15:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:15:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:15:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:15:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 08:15:23,904 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-26 08:15:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:23,904 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 08:15:23,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:15:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 08:15:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:15:23,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:23,906 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-26 08:15:23,906 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:23,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash -223930615, now seen corresponding path program 50 times [2018-09-26 08:15:23,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:24,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:24,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:15:24,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:15:24,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:15:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:15:24,071 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 31 states. [2018-09-26 08:15:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:24,243 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-26 08:15:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:15:24,243 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 108 [2018-09-26 08:15:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:24,244 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:15:24,245 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:15:24,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1248, Invalid=2058, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:15:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:15:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-09-26 08:15:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:15:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:15:24,286 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-26 08:15:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:24,287 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:15:24,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:15:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:15:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:15:24,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:24,291 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-26 08:15:24,292 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:24,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -449022971, now seen corresponding path program 51 times [2018-09-26 08:15:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 702 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:24,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:24,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:15:24,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:15:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:15:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:15:24,529 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-09-26 08:15:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:24,900 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2018-09-26 08:15:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:15:24,901 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-09-26 08:15:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:24,902 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:15:24,902 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:15:24,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:15:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:15:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:15:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:15:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-26 08:15:24,938 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-26 08:15:24,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:24,939 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-26 08:15:24,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:15:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-26 08:15:24,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:15:24,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:24,940 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-26 08:15:24,941 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:24,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:24,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1802883391, now seen corresponding path program 52 times [2018-09-26 08:15:24,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:25,062 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:25,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:15:25,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:15:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:15:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:15:25,063 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 32 states. [2018-09-26 08:15:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:25,219 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-09-26 08:15:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:15:25,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 112 [2018-09-26 08:15:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:25,220 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:15:25,220 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:15:25,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1336, Invalid=2204, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:15:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:15:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-09-26 08:15:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:15:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:15:25,257 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-26 08:15:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:25,257 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:15:25,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:15:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:15:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:15:25,258 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:25,259 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-26 08:15:25,259 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:25,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1699051707, now seen corresponding path program 53 times [2018-09-26 08:15:25,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:25,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:25,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:15:25,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:15:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:15:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:15:25,431 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-09-26 08:15:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:25,746 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-09-26 08:15:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:15:25,746 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-09-26 08:15:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:25,747 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:15:25,747 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:15:25,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:15:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:15:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:15:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:15:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-09-26 08:15:25,785 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-09-26 08:15:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:25,785 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-09-26 08:15:25,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:15:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-09-26 08:15:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:15:25,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:25,787 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2018-09-26 08:15:25,787 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:25,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1220126965, now seen corresponding path program 54 times [2018-09-26 08:15:25,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:25,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:25,914 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:15:25,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:15:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:15:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:15:25,915 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 33 states. [2018-09-26 08:15:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:26,067 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-09-26 08:15:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:15:26,067 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 116 [2018-09-26 08:15:26,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:26,068 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:15:26,068 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:15:26,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1427, Invalid=2355, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:15:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:15:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-09-26 08:15:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:15:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 08:15:26,104 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-09-26 08:15:26,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:26,105 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 08:15:26,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:15:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 08:15:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:15:26,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:26,106 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-26 08:15:26,106 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:26,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:26,107 INFO L82 PathProgramCache]: Analyzing trace with hash 15874801, now seen corresponding path program 55 times [2018-09-26 08:15:26,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 812 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:26,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:26,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:15:26,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:15:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:15:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:15:26,285 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-09-26 08:15:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:26,618 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-09-26 08:15:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:15:26,618 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-09-26 08:15:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:26,619 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:15:26,619 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:15:26,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:15:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:15:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:15:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:15:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-09-26 08:15:26,656 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-09-26 08:15:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:26,656 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-09-26 08:15:26,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:15:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-09-26 08:15:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:15:26,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:26,657 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2018-09-26 08:15:26,658 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:26,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1308639701, now seen corresponding path program 56 times [2018-09-26 08:15:26,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:26,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:26,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:15:26,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:15:26,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:15:26,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:15:26,788 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 34 states. [2018-09-26 08:15:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:26,945 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-09-26 08:15:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:15:26,946 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 120 [2018-09-26 08:15:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:26,947 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:15:26,947 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:15:26,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1521, Invalid=2511, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:15:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:15:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-09-26 08:15:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:15:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:15:26,983 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-09-26 08:15:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:26,983 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:15:26,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:15:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:15:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:15:26,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:26,985 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-26 08:15:26,985 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:26,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:26,985 INFO L82 PathProgramCache]: Analyzing trace with hash 822598311, now seen corresponding path program 57 times [2018-09-26 08:15:26,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:27,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:27,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:15:27,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:15:27,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:15:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:15:27,206 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-09-26 08:15:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:27,627 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-09-26 08:15:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:15:27,628 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-09-26 08:15:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:27,629 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:15:27,629 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:15:27,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:15:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:15:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:15:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:15:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-09-26 08:15:27,672 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-09-26 08:15:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:27,672 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-09-26 08:15:27,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:15:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-09-26 08:15:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:15:27,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:27,674 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2018-09-26 08:15:27,674 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:27,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash -858967839, now seen corresponding path program 58 times [2018-09-26 08:15:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:27,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:27,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:15:27,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:15:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:15:27,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:15:27,815 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 35 states. [2018-09-26 08:15:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:27,985 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-26 08:15:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:15:27,985 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 124 [2018-09-26 08:15:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:27,986 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:15:27,987 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:15:27,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1618, Invalid=2672, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:15:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:15:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-09-26 08:15:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:15:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:15:28,029 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-09-26 08:15:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:28,030 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:15:28,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:15:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:15:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:15:28,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:28,031 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-26 08:15:28,032 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:28,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash -834439203, now seen corresponding path program 59 times [2018-09-26 08:15:28,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:28,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:28,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:15:28,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:15:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:15:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:15:28,223 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-09-26 08:15:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:28,589 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-09-26 08:15:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:15:28,589 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-09-26 08:15:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:28,590 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:15:28,590 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:15:28,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:15:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:15:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:15:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:15:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 08:15:28,635 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-26 08:15:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 08:15:28,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:15:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 08:15:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:15:28,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:28,637 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-26 08:15:28,637 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:28,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:28,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1096867561, now seen corresponding path program 60 times [2018-09-26 08:15:28,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:28,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:28,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:15:28,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:15:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:15:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:15:28,784 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 36 states. [2018-09-26 08:15:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:28,958 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-26 08:15:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:15:28,959 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 128 [2018-09-26 08:15:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:28,960 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:15:28,960 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:15:28,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1718, Invalid=2838, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:15:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:15:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-09-26 08:15:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:15:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:15:28,999 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-26 08:15:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:29,000 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:15:29,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:15:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:15:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:15:29,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:29,001 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-26 08:15:29,001 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:29,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1822805357, now seen corresponding path program 61 times [2018-09-26 08:15:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:29,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:29,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:15:29,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:15:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:15:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:15:29,203 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-09-26 08:15:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:29,582 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-09-26 08:15:29,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:15:29,583 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-09-26 08:15:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:29,584 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:15:29,584 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:15:29,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:15:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:15:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:15:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:15:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 08:15:29,631 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-26 08:15:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:29,631 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 08:15:29,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:15:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 08:15:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:15:29,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:29,635 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-26 08:15:29,635 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:29,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 787132109, now seen corresponding path program 62 times [2018-09-26 08:15:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:29,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:29,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:15:29,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:15:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:15:29,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:15:29,786 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 37 states. [2018-09-26 08:15:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:29,968 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-09-26 08:15:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:15:29,969 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 132 [2018-09-26 08:15:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:29,970 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:15:29,970 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:15:29,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1821, Invalid=3009, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:15:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:15:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-09-26 08:15:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:15:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:15:30,016 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-26 08:15:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:30,017 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:15:30,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:15:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:15:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:15:30,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:30,018 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-26 08:15:30,019 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:30,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash 519645897, now seen corresponding path program 63 times [2018-09-26 08:15:30,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1056 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:30,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:30,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:15:30,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:15:30,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:15:30,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:15:30,288 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-09-26 08:15:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:30,882 INFO L93 Difference]: Finished difference Result 206 states and 208 transitions. [2018-09-26 08:15:30,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:15:30,882 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-09-26 08:15:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:30,883 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:15:30,883 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:15:30,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:15:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:15:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:15:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:15:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-09-26 08:15:30,932 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-09-26 08:15:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:30,933 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-09-26 08:15:30,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:15:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-09-26 08:15:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:15:30,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:30,936 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2018-09-26 08:15:30,936 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:30,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1226635779, now seen corresponding path program 64 times [2018-09-26 08:15:30,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:31,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:31,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:15:31,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:15:31,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:15:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:15:31,072 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 38 states. [2018-09-26 08:15:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:31,242 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-26 08:15:31,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:15:31,243 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 136 [2018-09-26 08:15:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:31,244 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:15:31,244 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:15:31,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1927, Invalid=3185, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:15:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:15:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-09-26 08:15:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:15:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:15:31,291 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-09-26 08:15:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:31,291 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:15:31,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:15:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:15:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:15:31,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:31,293 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-26 08:15:31,293 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:31,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1975877759, now seen corresponding path program 65 times [2018-09-26 08:15:31,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:31,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:31,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:15:31,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:15:31,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:15:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:15:31,490 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-09-26 08:15:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:31,911 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-09-26 08:15:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:15:31,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-09-26 08:15:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:31,912 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:15:31,912 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:15:31,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:15:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:15:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:15:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:15:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 08:15:31,963 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-26 08:15:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:31,963 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 08:15:31,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:15:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 08:15:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:15:31,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:31,965 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-26 08:15:31,965 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:31,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1050354361, now seen corresponding path program 66 times [2018-09-26 08:15:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:32,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:32,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:15:32,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:15:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:15:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:15:32,114 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 39 states. [2018-09-26 08:15:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:32,290 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-09-26 08:15:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:15:32,290 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 140 [2018-09-26 08:15:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:32,292 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:15:32,292 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:15:32,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2036, Invalid=3366, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:15:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:15:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2018-09-26 08:15:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:15:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 08:15:32,340 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-26 08:15:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 08:15:32,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:15:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 08:15:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:15:32,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:32,342 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-26 08:15:32,342 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:32,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 73159605, now seen corresponding path program 67 times [2018-09-26 08:15:32,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1190 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:32,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:32,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:15:32,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:15:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:15:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:15:32,549 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-09-26 08:15:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:32,965 INFO L93 Difference]: Finished difference Result 218 states and 220 transitions. [2018-09-26 08:15:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:15:32,965 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-09-26 08:15:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:32,966 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:15:32,967 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:15:32,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:15:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:15:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:15:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:15:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-26 08:15:33,011 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-09-26 08:15:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:33,011 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-26 08:15:33,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:15:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-26 08:15:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:15:33,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:33,013 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-09-26 08:15:33,013 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:33,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1220692207, now seen corresponding path program 68 times [2018-09-26 08:15:33,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:33,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:33,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:15:33,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:15:33,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:15:33,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:15:33,155 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 40 states. [2018-09-26 08:15:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:33,344 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-09-26 08:15:33,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:15:33,344 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 144 [2018-09-26 08:15:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:33,345 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:15:33,345 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:15:33,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2148, Invalid=3552, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:15:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:15:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-09-26 08:15:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:15:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:15:33,395 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-09-26 08:15:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:33,396 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:15:33,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:15:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:15:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:15:33,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:33,397 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-09-26 08:15:33,398 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:33,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 559072363, now seen corresponding path program 69 times [2018-09-26 08:15:33,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:33,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:33,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:15:33,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:15:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:15:33,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:15:33,607 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-09-26 08:15:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:34,107 INFO L93 Difference]: Finished difference Result 224 states and 226 transitions. [2018-09-26 08:15:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:15:34,107 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-09-26 08:15:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:34,108 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:15:34,108 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:15:34,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:15:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:15:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:15:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:15:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-09-26 08:15:34,159 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-09-26 08:15:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:34,160 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-09-26 08:15:34,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:15:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-09-26 08:15:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:15:34,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:34,162 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2018-09-26 08:15:34,162 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:34,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash 719817893, now seen corresponding path program 70 times [2018-09-26 08:15:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:34,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:34,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:15:34,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:15:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:15:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:15:34,301 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 41 states. [2018-09-26 08:15:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:34,465 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-09-26 08:15:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:15:34,465 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 148 [2018-09-26 08:15:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:34,466 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:15:34,467 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:15:34,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2263, Invalid=3743, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:15:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:15:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2018-09-26 08:15:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:15:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:15:34,518 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-09-26 08:15:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:34,519 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:15:34,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:15:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:15:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:15:34,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:34,520 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-09-26 08:15:34,520 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:34,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 255193761, now seen corresponding path program 71 times [2018-09-26 08:15:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1332 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:34,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:34,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:15:34,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:15:34,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:15:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:15:34,730 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-09-26 08:15:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,224 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2018-09-26 08:15:35,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:15:35,224 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-09-26 08:15:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,225 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:15:35,225 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:15:35,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:15:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:15:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:15:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:15:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-09-26 08:15:35,274 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-09-26 08:15:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,274 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-09-26 08:15:35,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:15:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-09-26 08:15:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:15:35,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,276 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2018-09-26 08:15:35,276 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash 878185947, now seen corresponding path program 72 times [2018-09-26 08:15:35,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:15:35,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:15:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:15:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:15:35,430 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 42 states. [2018-09-26 08:15:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:35,622 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-09-26 08:15:35,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:15:35,623 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 152 [2018-09-26 08:15:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:35,624 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:15:35,624 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:15:35,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2381, Invalid=3939, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:15:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:15:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-09-26 08:15:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:15:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:15:35,685 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-09-26 08:15:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:35,685 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:15:35,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:15:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:15:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:15:35,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:35,687 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-09-26 08:15:35,687 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:35,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2123038295, now seen corresponding path program 73 times [2018-09-26 08:15:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:15:35,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:15:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:15:35,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:15:35,935 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-09-26 08:15:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,519 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-09-26 08:15:36,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:15:36,519 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-09-26 08:15:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,521 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:15:36,521 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:15:36,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:15:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:15:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:15:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:15:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-09-26 08:15:36,582 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-09-26 08:15:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,583 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-09-26 08:15:36,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:15:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-09-26 08:15:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:15:36,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,584 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2018-09-26 08:15:36,584 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1034359663, now seen corresponding path program 74 times [2018-09-26 08:15:36,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:36,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:36,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:15:36,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:15:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:15:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:15:36,777 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 43 states. [2018-09-26 08:15:37,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,007 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-09-26 08:15:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:15:37,007 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 156 [2018-09-26 08:15:37,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,009 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:15:37,009 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:15:37,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2502, Invalid=4140, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:15:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:15:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-09-26 08:15:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:15:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:15:37,070 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-09-26 08:15:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,071 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:15:37,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:15:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:15:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:15:37,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,072 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-09-26 08:15:37,073 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1882257523, now seen corresponding path program 75 times [2018-09-26 08:15:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1482 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:37,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:37,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:15:37,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:15:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:15:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:15:37,405 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-09-26 08:15:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:37,932 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-09-26 08:15:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:15:37,932 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-09-26 08:15:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:37,934 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:15:37,934 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:15:37,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:15:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:15:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:15:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:15:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-09-26 08:15:37,987 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-09-26 08:15:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:37,987 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-09-26 08:15:37,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:15:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-09-26 08:15:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:15:37,988 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:37,989 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-09-26 08:15:37,989 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:37,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1109870791, now seen corresponding path program 76 times [2018-09-26 08:15:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:15:38,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:15:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:15:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:15:38,146 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 44 states. [2018-09-26 08:15:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:38,326 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-09-26 08:15:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:15:38,326 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 160 [2018-09-26 08:15:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:38,327 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:15:38,327 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:15:38,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2626, Invalid=4346, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:15:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:15:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2018-09-26 08:15:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:15:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:15:38,374 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-09-26 08:15:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:38,375 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:15:38,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:15:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:15:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:15:38,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:38,376 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-09-26 08:15:38,376 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:38,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:38,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1433873987, now seen corresponding path program 77 times [2018-09-26 08:15:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,599 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:15:38,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:15:38,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:15:38,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:15:38,601 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-09-26 08:15:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:39,224 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-09-26 08:15:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:15:39,225 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-09-26 08:15:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:39,225 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:15:39,226 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:15:39,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:15:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:15:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:15:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:15:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-26 08:15:39,265 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-09-26 08:15:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:39,265 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-26 08:15:39,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:15:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-26 08:15:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:15:39,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:39,266 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-09-26 08:15:39,267 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:39,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1292352899, now seen corresponding path program 78 times [2018-09-26 08:15:39,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:39,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:39,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:15:39,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:15:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:15:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:15:39,433 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 45 states. [2018-09-26 08:15:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:39,615 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-09-26 08:15:39,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:15:39,616 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 164 [2018-09-26 08:15:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:39,617 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:15:39,617 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:15:39,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2753, Invalid=4557, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:15:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:15:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2018-09-26 08:15:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:15:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-26 08:15:39,658 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-09-26 08:15:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:39,659 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-26 08:15:39,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:15:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-26 08:15:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:15:39,660 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:39,660 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-09-26 08:15:39,660 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:39,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash -705654151, now seen corresponding path program 79 times [2018-09-26 08:15:39,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1640 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:39,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:39,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:15:39,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:15:39,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:15:39,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:15:39,891 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-09-26 08:15:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,357 INFO L93 Difference]: Finished difference Result 254 states and 256 transitions. [2018-09-26 08:15:40,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:15:40,357 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-09-26 08:15:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,358 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:15:40,358 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:15:40,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:15:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:15:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:15:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:15:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-09-26 08:15:40,399 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-09-26 08:15:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,399 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-09-26 08:15:40,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:15:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-09-26 08:15:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:15:40,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,400 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2018-09-26 08:15:40,401 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1476855373, now seen corresponding path program 80 times [2018-09-26 08:15:40,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:40,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:40,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:15:40,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:15:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:15:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:15:40,610 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 46 states. [2018-09-26 08:15:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,781 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-09-26 08:15:40,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:15:40,781 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 168 [2018-09-26 08:15:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,782 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:15:40,782 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:15:40,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2883, Invalid=4773, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:15:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:15:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-09-26 08:15:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:15:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:15:40,824 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-09-26 08:15:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,824 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:15:40,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:15:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:15:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:15:40,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,825 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-09-26 08:15:40,825 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1918872529, now seen corresponding path program 81 times [2018-09-26 08:15:40,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:40,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:40,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:15:40,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:15:40,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:15:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:15:40,979 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-09-26 08:15:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:41,427 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2018-09-26 08:15:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:15:41,427 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-09-26 08:15:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:41,428 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:15:41,428 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:15:41,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:15:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:15:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:15:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:15:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-09-26 08:15:41,469 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-09-26 08:15:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:41,469 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-09-26 08:15:41,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:15:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-09-26 08:15:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:15:41,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:41,470 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2018-09-26 08:15:41,470 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:41,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -900821399, now seen corresponding path program 82 times [2018-09-26 08:15:41,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:41,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:41,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:15:41,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:15:41,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:15:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:15:41,592 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 47 states. [2018-09-26 08:15:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:41,755 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-09-26 08:15:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:15:41,756 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 172 [2018-09-26 08:15:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:41,756 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:15:41,757 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:15:41,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3016, Invalid=4994, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:15:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:15:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-09-26 08:15:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:15:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:15:41,795 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-09-26 08:15:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:41,796 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:15:41,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:15:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:15:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:15:41,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:41,797 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-09-26 08:15:41,797 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:41,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1893962597, now seen corresponding path program 83 times [2018-09-26 08:15:41,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1806 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:41,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:41,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:15:41,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:15:41,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:15:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:15:41,980 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-09-26 08:15:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:42,429 INFO L93 Difference]: Finished difference Result 266 states and 268 transitions. [2018-09-26 08:15:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:15:42,429 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-09-26 08:15:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:42,430 INFO L225 Difference]: With dead ends: 266 [2018-09-26 08:15:42,430 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:15:42,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:15:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:15:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:15:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:15:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-26 08:15:42,472 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-09-26 08:15:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:42,472 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-26 08:15:42,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:15:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-26 08:15:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:15:42,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:42,474 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-09-26 08:15:42,474 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash -619306849, now seen corresponding path program 84 times [2018-09-26 08:15:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:42,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:42,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:15:42,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:15:42,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:15:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:15:42,608 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 48 states. [2018-09-26 08:15:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:42,770 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-09-26 08:15:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:15:42,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 176 [2018-09-26 08:15:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:42,771 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:15:42,771 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:15:42,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3152, Invalid=5220, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:15:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:15:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-09-26 08:15:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:15:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:15:42,816 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-09-26 08:15:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:42,817 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:15:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:15:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:15:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:15:42,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:42,818 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-09-26 08:15:42,819 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:42,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1846505499, now seen corresponding path program 85 times [2018-09-26 08:15:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:43,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:43,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:15:43,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:15:43,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:15:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:15:43,101 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-09-26 08:15:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:43,596 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-09-26 08:15:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:15:43,596 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-09-26 08:15:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:43,597 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:15:43,597 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:15:43,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:15:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:15:43,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:15:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:15:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-09-26 08:15:43,646 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-09-26 08:15:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:43,646 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-09-26 08:15:43,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:15:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-09-26 08:15:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:15:43,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:43,648 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2018-09-26 08:15:43,648 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:43,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash 895799381, now seen corresponding path program 86 times [2018-09-26 08:15:43,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:43,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:43,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:15:43,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:15:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:15:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:15:43,789 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 49 states. [2018-09-26 08:15:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:43,925 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-09-26 08:15:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:15:43,925 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 180 [2018-09-26 08:15:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:43,926 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:15:43,926 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:15:43,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3291, Invalid=5451, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:15:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:15:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-09-26 08:15:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:15:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:15:43,975 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-09-26 08:15:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:43,976 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:15:43,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:15:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:15:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:15:43,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:43,977 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-09-26 08:15:43,977 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:43,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1869679185, now seen corresponding path program 87 times [2018-09-26 08:15:43,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1980 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:44,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:44,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:15:44,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:15:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:15:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:15:44,168 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-09-26 08:15:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:44,695 INFO L93 Difference]: Finished difference Result 278 states and 280 transitions. [2018-09-26 08:15:44,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:15:44,695 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-09-26 08:15:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:44,696 INFO L225 Difference]: With dead ends: 278 [2018-09-26 08:15:44,696 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:15:44,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:15:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:15:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:15:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:15:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-09-26 08:15:44,745 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-09-26 08:15:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:44,746 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-09-26 08:15:44,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:15:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-09-26 08:15:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:15:44,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:44,747 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2018-09-26 08:15:44,747 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:44,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash -800604789, now seen corresponding path program 88 times [2018-09-26 08:15:44,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:44,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:44,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:15:44,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:15:44,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:15:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:15:44,891 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 50 states. [2018-09-26 08:15:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:45,031 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-09-26 08:15:45,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:15:45,031 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 184 [2018-09-26 08:15:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:45,032 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:15:45,032 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:15:45,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:15:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:15:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2018-09-26 08:15:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:15:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:15:45,098 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-09-26 08:15:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:45,098 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:15:45,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:15:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:15:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:15:45,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:45,099 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-09-26 08:15:45,099 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:45,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:45,100 INFO L82 PathProgramCache]: Analyzing trace with hash -582123001, now seen corresponding path program 89 times [2018-09-26 08:15:45,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:45,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:45,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:15:45,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:15:45,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:15:45,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:15:45,283 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-09-26 08:15:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:45,786 INFO L93 Difference]: Finished difference Result 284 states and 286 transitions. [2018-09-26 08:15:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:15:45,786 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-09-26 08:15:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:45,787 INFO L225 Difference]: With dead ends: 284 [2018-09-26 08:15:45,787 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:15:45,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:15:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:15:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:15:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:15:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-09-26 08:15:45,875 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-09-26 08:15:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:45,876 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-09-26 08:15:45,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:15:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-09-26 08:15:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:15:45,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:45,876 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2018-09-26 08:15:45,877 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:45,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:45,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1060894655, now seen corresponding path program 90 times [2018-09-26 08:15:45,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:46,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:46,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:15:46,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:15:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:15:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:15:46,016 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 51 states. [2018-09-26 08:15:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:46,185 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-09-26 08:15:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:15:46,186 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 188 [2018-09-26 08:15:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:46,187 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:15:46,187 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:15:46,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3578, Invalid=5928, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:15:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:15:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2018-09-26 08:15:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:15:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-26 08:15:46,233 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-09-26 08:15:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:46,233 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-26 08:15:46,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:15:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-26 08:15:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:15:46,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:46,234 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-09-26 08:15:46,234 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:46,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1612581059, now seen corresponding path program 91 times [2018-09-26 08:15:46,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 2162 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:46,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:46,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:15:46,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:15:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:15:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:15:46,445 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-09-26 08:15:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:47,058 INFO L93 Difference]: Finished difference Result 290 states and 292 transitions. [2018-09-26 08:15:47,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:15:47,058 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-09-26 08:15:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:47,059 INFO L225 Difference]: With dead ends: 290 [2018-09-26 08:15:47,060 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:15:47,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:15:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:15:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:15:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:15:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-09-26 08:15:47,114 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-09-26 08:15:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:47,114 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-09-26 08:15:47,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:15:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-09-26 08:15:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:15:47,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:47,115 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2018-09-26 08:15:47,115 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:47,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1003933815, now seen corresponding path program 92 times [2018-09-26 08:15:47,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:47,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:47,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:15:47,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:15:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:15:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:15:47,267 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 52 states. [2018-09-26 08:15:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:47,449 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-09-26 08:15:47,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:15:47,449 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 192 [2018-09-26 08:15:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:47,450 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:15:47,450 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:15:47,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3726, Invalid=6174, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:15:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:15:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-09-26 08:15:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:15:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:15:47,507 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-09-26 08:15:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:47,507 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:15:47,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:15:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:15:47,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:15:47,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:47,509 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-09-26 08:15:47,509 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:47,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1587312141, now seen corresponding path program 93 times [2018-09-26 08:15:47,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:47,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:47,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:15:47,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:15:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:15:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:15:47,768 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-09-26 08:15:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:48,441 INFO L93 Difference]: Finished difference Result 296 states and 298 transitions. [2018-09-26 08:15:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:15:48,441 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-09-26 08:15:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:48,442 INFO L225 Difference]: With dead ends: 296 [2018-09-26 08:15:48,442 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:15:48,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:15:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:15:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:15:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:15:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-09-26 08:15:48,495 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-09-26 08:15:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:48,496 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-09-26 08:15:48,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:15:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-09-26 08:15:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:15:48,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:48,497 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-09-26 08:15:48,497 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:48,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 410334765, now seen corresponding path program 94 times [2018-09-26 08:15:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:48,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:48,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:15:48,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:15:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:15:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:15:48,744 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 53 states. [2018-09-26 08:15:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:49,010 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-09-26 08:15:49,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:15:49,010 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 196 [2018-09-26 08:15:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:49,011 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:15:49,011 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:15:49,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3877, Invalid=6425, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:15:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:15:49,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2018-09-26 08:15:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:15:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:15:49,106 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-09-26 08:15:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:49,106 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:15:49,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:15:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:15:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:15:49,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:49,108 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-09-26 08:15:49,108 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:49,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash -805348823, now seen corresponding path program 95 times [2018-09-26 08:15:49,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 2352 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:49,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:49,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:15:49,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:15:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:15:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:15:49,397 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-09-26 08:15:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:50,020 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-09-26 08:15:50,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:15:50,020 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-09-26 08:15:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:50,021 INFO L225 Difference]: With dead ends: 302 [2018-09-26 08:15:50,021 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:15:50,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:15:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:15:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:15:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:15:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-26 08:15:50,083 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-09-26 08:15:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:50,083 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-26 08:15:50,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:15:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-26 08:15:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:15:50,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:50,084 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-09-26 08:15:50,084 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:50,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash -779331229, now seen corresponding path program 96 times [2018-09-26 08:15:50,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:50,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:50,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:15:50,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:15:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:15:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:15:50,232 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 54 states. [2018-09-26 08:15:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:50,422 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-09-26 08:15:50,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:15:50,422 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 200 [2018-09-26 08:15:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:50,423 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:15:50,423 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:15:50,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4031, Invalid=6681, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:15:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:15:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-09-26 08:15:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:15:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:15:50,488 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-09-26 08:15:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:50,488 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:15:50,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:15:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:15:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:15:50,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:50,489 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-09-26 08:15:50,489 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:50,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1613068321, now seen corresponding path program 97 times [2018-09-26 08:15:50,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:50,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:50,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:15:50,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:15:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:15:50,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:15:50,748 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-09-26 08:15:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:51,481 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-09-26 08:15:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:15:51,481 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-09-26 08:15:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:51,482 INFO L225 Difference]: With dead ends: 308 [2018-09-26 08:15:51,482 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:15:51,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:15:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:15:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:15:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:15:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-09-26 08:15:51,538 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-09-26 08:15:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:51,539 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-09-26 08:15:51,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:15:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-09-26 08:15:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:15:51,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:51,540 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2018-09-26 08:15:51,540 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:51,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash 134306329, now seen corresponding path program 98 times [2018-09-26 08:15:51,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:51,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:51,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:15:51,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:15:51,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:15:51,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:15:51,695 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 55 states. [2018-09-26 08:15:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:51,866 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-09-26 08:15:51,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:15:51,866 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-09-26 08:15:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:51,867 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:15:51,867 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:15:51,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2601 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4188, Invalid=6942, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:15:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:15:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-09-26 08:15:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:15:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:15:51,929 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-09-26 08:15:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:51,929 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:15:51,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:15:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:15:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:15:51,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:51,930 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-09-26 08:15:51,931 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:51,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash 219296533, now seen corresponding path program 99 times [2018-09-26 08:15:51,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 2550 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:52,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:52,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:15:52,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:15:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:15:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:15:52,230 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-09-26 08:15:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:52,619 INFO L93 Difference]: Finished difference Result 314 states and 316 transitions. [2018-09-26 08:15:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:15:52,620 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-09-26 08:15:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:52,621 INFO L225 Difference]: With dead ends: 314 [2018-09-26 08:15:52,621 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:15:52,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:15:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:15:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:15:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:15:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-09-26 08:15:52,691 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-09-26 08:15:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:52,691 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-09-26 08:15:52,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:15:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-09-26 08:15:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:15:52,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:52,692 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2018-09-26 08:15:52,692 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:52,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2068752305, now seen corresponding path program 100 times [2018-09-26 08:15:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:52,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:52,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:15:52,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:15:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:15:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:15:52,849 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 56 states. [2018-09-26 08:15:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:53,018 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-09-26 08:15:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:15:53,019 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 208 [2018-09-26 08:15:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:53,020 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:15:53,020 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:15:53,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4348, Invalid=7208, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:15:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:15:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-09-26 08:15:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:15:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:15:53,075 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-09-26 08:15:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:53,075 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:15:53,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:15:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:15:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:15:53,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:53,076 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-09-26 08:15:53,076 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:53,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash 498826187, now seen corresponding path program 101 times [2018-09-26 08:15:53,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:53,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:53,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:15:53,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:15:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:15:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:15:53,304 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-09-26 08:15:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:54,003 INFO L93 Difference]: Finished difference Result 320 states and 322 transitions. [2018-09-26 08:15:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:15:54,003 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-09-26 08:15:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:54,003 INFO L225 Difference]: With dead ends: 320 [2018-09-26 08:15:54,003 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:15:54,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:15:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:15:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:15:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:15:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-26 08:15:54,071 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-09-26 08:15:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:54,072 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-26 08:15:54,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:15:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-26 08:15:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:15:54,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:54,073 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-09-26 08:15:54,073 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:54,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1166969851, now seen corresponding path program 102 times [2018-09-26 08:15:54,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:54,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:54,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:15:54,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:15:54,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:15:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:15:54,238 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 57 states. [2018-09-26 08:15:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:54,426 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-09-26 08:15:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:15:54,426 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 212 [2018-09-26 08:15:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:54,426 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:15:54,427 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:15:54,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4511, Invalid=7479, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:15:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:15:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-09-26 08:15:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:15:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-26 08:15:54,489 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-09-26 08:15:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:54,489 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-26 08:15:54,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:15:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-26 08:15:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:15:54,490 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:54,490 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-09-26 08:15:54,490 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:54,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash -471629311, now seen corresponding path program 103 times [2018-09-26 08:15:54,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 2756 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:54,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:54,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:15:54,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:15:54,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:15:54,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:15:54,750 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 108 states. [2018-09-26 08:15:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:55,673 INFO L93 Difference]: Finished difference Result 326 states and 328 transitions. [2018-09-26 08:15:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:15:55,673 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-09-26 08:15:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:55,674 INFO L225 Difference]: With dead ends: 326 [2018-09-26 08:15:55,674 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:15:55,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4082 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:15:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:15:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:15:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:15:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-26 08:15:55,730 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2018-09-26 08:15:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:55,730 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-26 08:15:55,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:15:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-26 08:15:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:15:55,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:55,731 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-09-26 08:15:55,731 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:55,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash -938554053, now seen corresponding path program 104 times [2018-09-26 08:15:55,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:55,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:55,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:15:55,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:15:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:15:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:15:55,909 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 58 states. [2018-09-26 08:15:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:56,125 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-09-26 08:15:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:15:56,125 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 216 [2018-09-26 08:15:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:56,126 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:15:56,126 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:15:56,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4677, Invalid=7755, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:15:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:15:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2018-09-26 08:15:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:15:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:15:56,198 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-09-26 08:15:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:56,198 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:15:56,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:15:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:15:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:15:56,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:56,199 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-09-26 08:15:56,199 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:56,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash -7379529, now seen corresponding path program 105 times [2018-09-26 08:15:56,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:56,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:56,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:15:56,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:15:56,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:15:56,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:15:56,472 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 110 states. [2018-09-26 08:15:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:56,993 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2018-09-26 08:15:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:15:56,993 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-09-26 08:15:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:56,994 INFO L225 Difference]: With dead ends: 332 [2018-09-26 08:15:56,994 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:15:56,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:15:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:15:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:15:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:15:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-09-26 08:15:57,061 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-09-26 08:15:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:57,061 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-09-26 08:15:57,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:15:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-09-26 08:15:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:15:57,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:57,062 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2018-09-26 08:15:57,062 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:57,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash -95517711, now seen corresponding path program 106 times [2018-09-26 08:15:57,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:57,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:57,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:15:57,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:15:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:15:57,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=1767, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:15:57,270 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 59 states. [2018-09-26 08:15:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:57,479 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-09-26 08:15:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:15:57,480 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 220 [2018-09-26 08:15:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:57,480 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:15:57,480 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:15:57,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4846, Invalid=8036, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:15:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:15:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2018-09-26 08:15:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:15:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:15:57,538 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2018-09-26 08:15:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:57,539 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:15:57,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:15:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:15:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:15:57,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:57,540 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-09-26 08:15:57,540 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:57,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1598273811, now seen corresponding path program 107 times [2018-09-26 08:15:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 2970 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:57,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:57,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:15:57,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:15:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:15:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:15:57,815 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 112 states. [2018-09-26 08:15:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:58,507 INFO L93 Difference]: Finished difference Result 338 states and 340 transitions. [2018-09-26 08:15:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:15:58,507 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-09-26 08:15:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:58,508 INFO L225 Difference]: With dead ends: 338 [2018-09-26 08:15:58,508 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:15:58,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:15:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:15:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:15:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:15:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-09-26 08:15:58,579 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2018-09-26 08:15:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:58,579 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-09-26 08:15:58,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:15:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-09-26 08:15:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:15:58,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:58,580 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2018-09-26 08:15:58,580 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:58,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash -840058841, now seen corresponding path program 108 times [2018-09-26 08:15:58,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:58,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:58,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:15:58,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:15:58,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:15:58,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:15:58,792 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 60 states. [2018-09-26 08:15:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:59,029 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-09-26 08:15:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:15:59,029 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 224 [2018-09-26 08:15:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:59,030 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:15:59,030 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:15:59,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5018, Invalid=8322, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:15:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:15:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2018-09-26 08:15:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:15:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:15:59,104 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-09-26 08:15:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:59,104 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:15:59,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:15:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:15:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:15:59,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:59,105 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-09-26 08:15:59,105 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:59,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash 157238691, now seen corresponding path program 109 times [2018-09-26 08:15:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:59,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:59,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:15:59,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:15:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:15:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:15:59,421 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 114 states. [2018-09-26 08:15:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:59,847 INFO L93 Difference]: Finished difference Result 344 states and 346 transitions. [2018-09-26 08:15:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:15:59,847 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-09-26 08:15:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:59,848 INFO L225 Difference]: With dead ends: 344 [2018-09-26 08:15:59,848 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:15:59,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4565 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:15:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:15:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:15:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:15:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-09-26 08:15:59,920 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-09-26 08:15:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:59,921 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-09-26 08:15:59,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:15:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-09-26 08:15:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:15:59,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:59,922 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2018-09-26 08:15:59,922 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:59,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1906411997, now seen corresponding path program 110 times [2018-09-26 08:15:59,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:00,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:00,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:16:00,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:16:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:16:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1772, Invalid=1888, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:16:00,220 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 61 states. [2018-09-26 08:16:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:00,531 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-09-26 08:16:00,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:16:00,531 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 228 [2018-09-26 08:16:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:00,532 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:16:00,532 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:16:00,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5193, Invalid=8613, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:16:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:16:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-09-26 08:16:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:16:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:16:00,649 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2018-09-26 08:16:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:00,649 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:16:00,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:16:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:16:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:16:00,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:00,651 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-09-26 08:16:00,651 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:00,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1889173031, now seen corresponding path program 111 times [2018-09-26 08:16:00,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3192 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:01,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:01,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:16:01,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:16:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:16:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:16:01,132 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 116 states. [2018-09-26 08:16:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:01,763 INFO L93 Difference]: Finished difference Result 350 states and 352 transitions. [2018-09-26 08:16:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:16:01,763 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-09-26 08:16:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:01,764 INFO L225 Difference]: With dead ends: 350 [2018-09-26 08:16:01,764 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:16:01,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4732 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:16:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:16:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:16:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:16:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-09-26 08:16:01,832 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2018-09-26 08:16:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:01,832 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-09-26 08:16:01,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:16:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-09-26 08:16:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:16:01,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:01,834 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2018-09-26 08:16:01,834 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:01,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash -938010349, now seen corresponding path program 112 times [2018-09-26 08:16:01,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:02,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:02,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:16:02,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:16:02,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:16:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:16:02,058 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 62 states. [2018-09-26 08:16:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:02,276 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-09-26 08:16:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:16:02,276 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 232 [2018-09-26 08:16:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:02,277 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:16:02,277 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:16:02,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3364 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5371, Invalid=8909, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:16:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:16:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2018-09-26 08:16:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:16:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:16:02,353 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-09-26 08:16:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:02,354 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:16:02,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:16:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:16:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:16:02,355 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:02,355 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-09-26 08:16:02,355 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:02,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 515120015, now seen corresponding path program 113 times [2018-09-26 08:16:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:02,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:02,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:16:02,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:16:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:16:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:16:02,796 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 118 states. [2018-09-26 08:16:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:03,446 INFO L93 Difference]: Finished difference Result 356 states and 358 transitions. [2018-09-26 08:16:03,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:16:03,446 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-09-26 08:16:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:03,447 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:16:03,447 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:16:03,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:16:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:16:03,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:16:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:16:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-09-26 08:16:03,547 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-09-26 08:16:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:03,548 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-09-26 08:16:03,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:16:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-09-26 08:16:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:16:03,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:03,549 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2018-09-26 08:16:03,549 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:03,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:03,550 INFO L82 PathProgramCache]: Analyzing trace with hash -369916471, now seen corresponding path program 114 times [2018-09-26 08:16:03,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:03,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:03,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:16:03,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:16:03,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:16:03,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:16:03,736 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 63 states. [2018-09-26 08:16:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:04,019 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-09-26 08:16:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:16:04,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 236 [2018-09-26 08:16:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:04,020 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:16:04,020 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:16:04,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5552, Invalid=9210, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:16:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:16:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2018-09-26 08:16:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:16:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-09-26 08:16:04,089 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2018-09-26 08:16:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:04,089 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-09-26 08:16:04,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:16:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-09-26 08:16:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:16:04,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:04,091 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-09-26 08:16:04,091 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:04,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 992490181, now seen corresponding path program 115 times [2018-09-26 08:16:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3422 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:04,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:04,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:16:04,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:16:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:16:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:16:04,416 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 120 states. [2018-09-26 08:16:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,108 INFO L93 Difference]: Finished difference Result 362 states and 364 transitions. [2018-09-26 08:16:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:16:05,109 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-09-26 08:16:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,109 INFO L225 Difference]: With dead ends: 362 [2018-09-26 08:16:05,109 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:16:05,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5075 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:16:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:16:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:16:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:16:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-09-26 08:16:05,187 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 238 [2018-09-26 08:16:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,187 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-09-26 08:16:05,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:16:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-09-26 08:16:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:16:05,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,189 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2018-09-26 08:16:05,189 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,189 INFO L82 PathProgramCache]: Analyzing trace with hash 668200959, now seen corresponding path program 116 times [2018-09-26 08:16:05,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:16:05,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:16:05,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:16:05,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:16:05,421 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 64 states. [2018-09-26 08:16:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,657 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-09-26 08:16:05,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:16:05,657 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 240 [2018-09-26 08:16:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,658 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:16:05,658 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:16:05,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3600 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5736, Invalid=9516, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:16:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:16:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-09-26 08:16:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:16:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:16:05,727 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-09-26 08:16:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,727 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:16:05,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:16:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:16:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:16:05,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,728 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-09-26 08:16:05,728 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2104039557, now seen corresponding path program 117 times [2018-09-26 08:16:05,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:16:06,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:16:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:16:06,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:16:06,076 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 122 states. [2018-09-26 08:16:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,997 INFO L93 Difference]: Finished difference Result 368 states and 370 transitions. [2018-09-26 08:16:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:16:06,997 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-09-26 08:16:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,997 INFO L225 Difference]: With dead ends: 368 [2018-09-26 08:16:06,998 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:16:06,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:16:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:16:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:16:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:16:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-09-26 08:16:07,069 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-09-26 08:16:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,070 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-09-26 08:16:07,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:16:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-09-26 08:16:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:16:07,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,071 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2018-09-26 08:16:07,071 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1941080139, now seen corresponding path program 118 times [2018-09-26 08:16:07,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:16:07,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:16:07,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:16:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2018, Invalid=2142, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:16:07,297 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 65 states. [2018-09-26 08:16:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,559 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2018-09-26 08:16:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:16:07,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2018-09-26 08:16:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,560 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:16:07,560 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:16:07,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3721 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5923, Invalid=9827, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:16:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:16:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-09-26 08:16:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:16:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-09-26 08:16:07,648 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 244 [2018-09-26 08:16:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,649 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-09-26 08:16:07,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:16:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-09-26 08:16:07,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:16:07,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,650 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-09-26 08:16:07,650 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1362273871, now seen corresponding path program 119 times [2018-09-26 08:16:07,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3660 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:16:07,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:16:07,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:16:07,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:16:07,956 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 124 states. [2018-09-26 08:16:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:08,686 INFO L93 Difference]: Finished difference Result 374 states and 376 transitions. [2018-09-26 08:16:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:16:08,686 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-09-26 08:16:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:08,687 INFO L225 Difference]: With dead ends: 374 [2018-09-26 08:16:08,687 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:16:08,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5430 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:16:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:16:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-09-26 08:16:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:16:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-09-26 08:16:08,771 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 246 [2018-09-26 08:16:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,771 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-09-26 08:16:08,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:16:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-09-26 08:16:08,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:16:08,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,772 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 60, 1, 1, 1, 1] [2018-09-26 08:16:08,772 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,773 INFO L82 PathProgramCache]: Analyzing trace with hash -571654933, now seen corresponding path program 120 times [2018-09-26 08:16:08,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:16:08,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:16:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:16:08,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:16:08,995 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 66 states. [2018-09-26 08:16:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,244 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-09-26 08:16:09,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:16:09,244 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 248 [2018-09-26 08:16:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,244 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:16:09,244 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:16:09,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6113, Invalid=10143, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:16:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:16:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2018-09-26 08:16:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:16:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-09-26 08:16:09,325 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-09-26 08:16:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,325 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-09-26 08:16:09,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:16:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-09-26 08:16:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:16:09,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,327 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-09-26 08:16:09,327 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash 395356519, now seen corresponding path program 121 times [2018-09-26 08:16:09,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:09,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:09,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:16:09,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:16:09,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:16:09,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:16:09,696 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 126 states. [2018-09-26 08:16:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:10,617 INFO L93 Difference]: Finished difference Result 380 states and 382 transitions. [2018-09-26 08:16:10,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:16:10,617 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-09-26 08:16:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:10,618 INFO L225 Difference]: With dead ends: 380 [2018-09-26 08:16:10,618 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:16:10,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5612 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:16:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:16:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:16:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:16:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-09-26 08:16:10,706 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-09-26 08:16:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:10,706 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-09-26 08:16:10,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:16:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-09-26 08:16:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:16:10,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:10,707 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 61, 1, 1, 1, 1] [2018-09-26 08:16:10,707 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:10,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash 557342625, now seen corresponding path program 122 times [2018-09-26 08:16:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:11,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:11,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:16:11,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:16:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:16:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:16:11,060 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 67 states. [2018-09-26 08:16:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:11,287 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-09-26 08:16:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:16:11,287 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 252 [2018-09-26 08:16:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:11,288 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:16:11,288 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:16:11,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3969 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6306, Invalid=10464, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:16:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:16:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-09-26 08:16:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:16:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-09-26 08:16:11,364 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 252 [2018-09-26 08:16:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:11,364 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-09-26 08:16:11,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:16:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-09-26 08:16:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:16:11,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:11,366 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-09-26 08:16:11,366 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:11,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:11,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1264716131, now seen corresponding path program 123 times [2018-09-26 08:16:11,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3906 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:11,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:11,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:16:11,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:16:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:16:11,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:16:11,686 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 128 states. [2018-09-26 08:16:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:12,543 INFO L93 Difference]: Finished difference Result 386 states and 388 transitions. [2018-09-26 08:16:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:16:12,544 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-09-26 08:16:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:12,544 INFO L225 Difference]: With dead ends: 386 [2018-09-26 08:16:12,544 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:16:12,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5797 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:16:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:16:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:16:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:16:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-09-26 08:16:12,637 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 254 [2018-09-26 08:16:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:12,637 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-09-26 08:16:12,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:16:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-09-26 08:16:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:16:12,639 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:12,639 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 62, 1, 1, 1, 1] [2018-09-26 08:16:12,639 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:12,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1700003881, now seen corresponding path program 124 times [2018-09-26 08:16:12,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:12,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:12,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:16:12,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:16:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:16:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:16:12,886 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 68 states. [2018-09-26 08:16:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:13,176 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-09-26 08:16:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:16:13,176 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 256 [2018-09-26 08:16:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:13,176 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:16:13,177 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:16:13,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6502, Invalid=10790, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:16:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:16:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2018-09-26 08:16:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:16:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:16:13,255 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-09-26 08:16:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:13,256 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:16:13,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:16:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:16:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:16:13,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:13,257 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-09-26 08:16:13,257 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:13,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1616223917, now seen corresponding path program 125 times [2018-09-26 08:16:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:13,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:13,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:16:13,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:16:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:16:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:16:13,600 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 130 states. [2018-09-26 08:16:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,463 INFO L93 Difference]: Finished difference Result 392 states and 394 transitions. [2018-09-26 08:16:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:16:14,464 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-09-26 08:16:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,464 INFO L225 Difference]: With dead ends: 392 [2018-09-26 08:16:14,464 INFO L226 Difference]: Without dead ends: 261 [2018-09-26 08:16:14,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:16:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-09-26 08:16:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-09-26 08:16:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:16:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-09-26 08:16:14,551 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-09-26 08:16:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,551 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-09-26 08:16:14,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:16:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-09-26 08:16:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:16:14,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,553 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 63, 1, 1, 1, 1] [2018-09-26 08:16:14,553 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1354579341, now seen corresponding path program 126 times [2018-09-26 08:16:14,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4160 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:16:14,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:16:14,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:16:14,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2280, Invalid=2412, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:16:14,847 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 69 states. [2018-09-26 08:16:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,099 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-09-26 08:16:15,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:16:15,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 260 [2018-09-26 08:16:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,101 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:16:15,101 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:16:15,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6701, Invalid=11121, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:16:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:16:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2018-09-26 08:16:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:16:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-09-26 08:16:15,191 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 260 [2018-09-26 08:16:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,191 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-09-26 08:16:15,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:16:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-09-26 08:16:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:16:15,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,192 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-09-26 08:16:15,192 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash 375589257, now seen corresponding path program 127 times [2018-09-26 08:16:15,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 4160 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:16:15,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:16:15,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:16:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:16:15,540 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 132 states. [2018-09-26 08:16:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,395 INFO L93 Difference]: Finished difference Result 398 states and 400 transitions. [2018-09-26 08:16:16,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:16:16,395 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-09-26 08:16:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,396 INFO L225 Difference]: With dead ends: 398 [2018-09-26 08:16:16,396 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:16:16,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8841, Invalid=29771, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:16:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:16:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-26 08:16:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:16:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-09-26 08:16:16,481 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 262 [2018-09-26 08:16:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,481 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-09-26 08:16:16,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:16:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-09-26 08:16:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:16:16,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,482 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 64, 1, 1, 1, 1] [2018-09-26 08:16:16,482 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash 232339651, now seen corresponding path program 128 times [2018-09-26 08:16:16,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,720 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:16:16,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:16:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:16:16,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2348, Invalid=2482, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:16:16,721 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 70 states. [2018-09-26 08:16:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,988 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2018-09-26 08:16:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:16:16,989 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 264 [2018-09-26 08:16:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,989 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:16:16,989 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:16:16,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6903, Invalid=11457, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:16:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:16:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2018-09-26 08:16:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:16:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:16:17,073 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-09-26 08:16:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,073 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:16:17,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:16:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:16:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:16:17,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,074 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-09-26 08:16:17,074 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash -59961537, now seen corresponding path program 129 times [2018-09-26 08:16:17,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:16:17,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:16:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:16:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:16:17,441 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 134 states. [2018-09-26 08:16:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:18,451 INFO L93 Difference]: Finished difference Result 404 states and 406 transitions. [2018-09-26 08:16:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:16:18,452 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-09-26 08:16:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:18,452 INFO L225 Difference]: With dead ends: 404 [2018-09-26 08:16:18,452 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:16:18,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9109, Invalid=30691, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:16:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:16:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-09-26 08:16:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:16:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-09-26 08:16:18,537 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-09-26 08:16:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:18,537 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-09-26 08:16:18,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:16:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-09-26 08:16:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:16:18,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:18,538 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 65, 1, 1, 1, 1] [2018-09-26 08:16:18,538 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:18,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash -496692871, now seen corresponding path program 130 times [2018-09-26 08:16:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4422 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:18,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:18,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:16:18,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:16:18,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:16:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2417, Invalid=2553, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:16:18,832 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 71 states. [2018-09-26 08:16:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:19,083 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-09-26 08:16:19,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:16:19,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 268 [2018-09-26 08:16:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:19,084 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:16:19,084 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:16:19,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7108, Invalid=11798, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:16:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:16:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-09-26 08:16:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:16:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-09-26 08:16:19,179 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 268 [2018-09-26 08:16:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:19,180 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-09-26 08:16:19,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:16:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-09-26 08:16:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:16:19,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:19,180 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-09-26 08:16:19,181 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:19,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash -580545931, now seen corresponding path program 131 times [2018-09-26 08:16:19,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4422 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:19,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:19,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:16:19,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:16:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:16:19,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:16:19,560 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 136 states. [2018-09-26 08:16:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:20,181 INFO L93 Difference]: Finished difference Result 410 states and 412 transitions. [2018-09-26 08:16:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:16:20,181 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-09-26 08:16:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:20,182 INFO L225 Difference]: With dead ends: 410 [2018-09-26 08:16:20,182 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:16:20,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6567 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9381, Invalid=31625, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:16:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:16:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-09-26 08:16:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:16:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-09-26 08:16:20,288 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 270 [2018-09-26 08:16:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:20,288 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-09-26 08:16:20,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:16:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-09-26 08:16:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:16:20,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:20,290 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 66, 1, 1, 1, 1] [2018-09-26 08:16:20,290 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:20,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash 649979823, now seen corresponding path program 132 times [2018-09-26 08:16:20,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:20,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:20,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:16:20,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:16:20,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:16:20,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:16:20,570 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 72 states. [2018-09-26 08:16:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:20,870 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2018-09-26 08:16:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:16:20,870 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 272 [2018-09-26 08:16:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:20,871 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:16:20,871 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:16:20,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4624 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7316, Invalid=12144, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:16:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:16:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-09-26 08:16:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:16:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-09-26 08:16:20,959 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-09-26 08:16:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:20,959 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-09-26 08:16:20,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:16:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-09-26 08:16:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:16:20,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:20,960 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-09-26 08:16:20,960 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:20,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1860285227, now seen corresponding path program 133 times [2018-09-26 08:16:20,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:21,336 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:21,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:16:21,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:16:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:16:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4829, Invalid=14077, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:16:21,338 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 138 states. [2018-09-26 08:16:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:22,318 INFO L93 Difference]: Finished difference Result 416 states and 418 transitions. [2018-09-26 08:16:22,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:16:22,319 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-09-26 08:16:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:22,319 INFO L225 Difference]: With dead ends: 416 [2018-09-26 08:16:22,319 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:16:22,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6767 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9657, Invalid=32573, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:16:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:16:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 08:16:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:16:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-09-26 08:16:22,468 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-09-26 08:16:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:22,469 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-09-26 08:16:22,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:16:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-09-26 08:16:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:16:22,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:22,470 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 67, 1, 1, 1, 1] [2018-09-26 08:16:22,470 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:22,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:22,471 INFO L82 PathProgramCache]: Analyzing trace with hash -46605467, now seen corresponding path program 134 times [2018-09-26 08:16:22,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4692 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:22,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:22,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:16:22,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:16:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:16:22,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2558, Invalid=2698, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:16:22,877 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 73 states. [2018-09-26 08:16:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:23,158 INFO L93 Difference]: Finished difference Result 285 states and 286 transitions. [2018-09-26 08:16:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:16:23,158 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 276 [2018-09-26 08:16:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:23,159 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:16:23,159 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:16:23,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4761 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7527, Invalid=12495, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:16:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:16:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-09-26 08:16:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:16:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-09-26 08:16:23,254 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 276 [2018-09-26 08:16:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:23,254 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-09-26 08:16:23,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:16:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-09-26 08:16:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:16:23,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:23,255 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-09-26 08:16:23,255 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:23,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1838247583, now seen corresponding path program 135 times [2018-09-26 08:16:23,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4692 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:23,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:23,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:16:23,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:16:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:16:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14491, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:16:23,651 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 140 states. [2018-09-26 08:16:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:24,663 INFO L93 Difference]: Finished difference Result 422 states and 424 transitions. [2018-09-26 08:16:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:16:24,664 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-09-26 08:16:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:24,664 INFO L225 Difference]: With dead ends: 422 [2018-09-26 08:16:24,664 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:16:24,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6970 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9937, Invalid=33535, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:16:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:16:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-09-26 08:16:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:16:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-09-26 08:16:24,757 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 278 [2018-09-26 08:16:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:24,757 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-09-26 08:16:24,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:16:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-09-26 08:16:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:16:24,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:24,758 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 68, 1, 1, 1, 1] [2018-09-26 08:16:24,759 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:24,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1411583131, now seen corresponding path program 136 times [2018-09-26 08:16:24,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:25,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:25,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:16:25,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:16:25,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:16:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:16:25,040 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 74 states. [2018-09-26 08:16:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:25,331 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-09-26 08:16:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:16:25,331 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 280 [2018-09-26 08:16:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:25,332 INFO L225 Difference]: With dead ends: 289 [2018-09-26 08:16:25,332 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:16:25,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7741, Invalid=12851, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:16:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:16:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2018-09-26 08:16:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:16:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-09-26 08:16:25,437 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-09-26 08:16:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:25,437 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-09-26 08:16:25,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:16:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-09-26 08:16:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:16:25,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:25,439 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-09-26 08:16:25,439 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:25,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash -678343401, now seen corresponding path program 137 times [2018-09-26 08:16:25,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:25,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:25,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:16:25,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:16:25,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:16:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5111, Invalid=14911, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:16:25,875 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 142 states. [2018-09-26 08:16:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,751 INFO L93 Difference]: Finished difference Result 428 states and 430 transitions. [2018-09-26 08:16:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:16:26,751 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-09-26 08:16:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,752 INFO L225 Difference]: With dead ends: 428 [2018-09-26 08:16:26,752 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 08:16:26,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10221, Invalid=34511, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:16:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 08:16:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-26 08:16:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:16:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-09-26 08:16:26,846 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-09-26 08:16:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,846 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-09-26 08:16:26,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:16:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-09-26 08:16:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:16:26,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,847 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 69, 1, 1, 1, 1] [2018-09-26 08:16:26,847 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1740741457, now seen corresponding path program 138 times [2018-09-26 08:16:26,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4970 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:16:27,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:16:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:16:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=2847, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:16:27,111 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 75 states. [2018-09-26 08:16:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,402 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-09-26 08:16:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:16:27,402 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 284 [2018-09-26 08:16:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,403 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:16:27,403 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:16:27,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7958, Invalid=13212, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:16:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:16:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2018-09-26 08:16:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:16:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-09-26 08:16:27,502 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 284 [2018-09-26 08:16:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,502 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-09-26 08:16:27,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:16:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-09-26 08:16:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:16:27,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,503 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-09-26 08:16:27,504 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2110195277, now seen corresponding path program 139 times [2018-09-26 08:16:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4970 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:16:27,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:16:27,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:16:27,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=15337, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:16:27,938 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 144 states. [2018-09-26 08:16:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,975 INFO L93 Difference]: Finished difference Result 434 states and 436 transitions. [2018-09-26 08:16:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:16:28,975 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-09-26 08:16:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,976 INFO L225 Difference]: With dead ends: 434 [2018-09-26 08:16:28,976 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:16:28,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10509, Invalid=35501, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:16:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:16:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-09-26 08:16:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:16:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-09-26 08:16:29,152 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 286 [2018-09-26 08:16:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:29,152 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-09-26 08:16:29,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:16:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-09-26 08:16:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:16:29,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:29,154 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 70, 1, 1, 1, 1] [2018-09-26 08:16:29,155 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:29,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:29,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1001281657, now seen corresponding path program 140 times [2018-09-26 08:16:29,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10082 backedges. 5112 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:29,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:29,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:16:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:16:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:16:29,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2777, Invalid=2923, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:16:29,607 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 76 states. [2018-09-26 08:16:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:29,929 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-09-26 08:16:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:16:29,929 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 288 [2018-09-26 08:16:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:29,930 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:16:29,930 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:16:29,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8178, Invalid=13578, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:16:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:16:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2018-09-26 08:16:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:16:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-09-26 08:16:30,029 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-09-26 08:16:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,029 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-09-26 08:16:30,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:16:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-09-26 08:16:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:16:30,030 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,030 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-09-26 08:16:30,030 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -159064829, now seen corresponding path program 141 times [2018-09-26 08:16:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 5112 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:16:30,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:16:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:16:30,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5401, Invalid=15769, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:16:30,505 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 146 states. [2018-09-26 08:16:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,607 INFO L93 Difference]: Finished difference Result 440 states and 442 transitions. [2018-09-26 08:16:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:16:31,607 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-09-26 08:16:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,608 INFO L225 Difference]: With dead ends: 440 [2018-09-26 08:16:31,608 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:16:31,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7597 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10801, Invalid=36505, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:16:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:16:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-09-26 08:16:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:16:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-09-26 08:16:31,710 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 290 [2018-09-26 08:16:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,710 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-09-26 08:16:31,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:16:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-09-26 08:16:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:16:31,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,711 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 71, 1, 1, 1, 1] [2018-09-26 08:16:31,711 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash -938979011, now seen corresponding path program 142 times [2018-09-26 08:16:31,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10368 backedges. 5256 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:31,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:31,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:16:31,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:16:31,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:16:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2852, Invalid=3000, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:16:31,997 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 77 states. [2018-09-26 08:16:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:32,310 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-09-26 08:16:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:16:32,310 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 292 [2018-09-26 08:16:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:32,311 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:16:32,311 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:16:32,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5329 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8401, Invalid=13949, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:16:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:16:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-09-26 08:16:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:16:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-09-26 08:16:32,412 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 292 [2018-09-26 08:16:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:32,412 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-09-26 08:16:32,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:16:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-09-26 08:16:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:16:32,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:32,413 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-09-26 08:16:32,413 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:32,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -415764167, now seen corresponding path program 143 times [2018-09-26 08:16:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 5256 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:32,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:32,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:16:32,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:16:32,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:16:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5549, Invalid=16207, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:16:32,850 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 148 states. [2018-09-26 08:16:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:34,070 INFO L93 Difference]: Finished difference Result 446 states and 448 transitions. [2018-09-26 08:16:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:16:34,071 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-09-26 08:16:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:34,071 INFO L225 Difference]: With dead ends: 446 [2018-09-26 08:16:34,072 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:16:34,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11097, Invalid=37523, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:16:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:16:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-09-26 08:16:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:16:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-09-26 08:16:34,177 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 294 [2018-09-26 08:16:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:34,177 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-09-26 08:16:34,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:16:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-09-26 08:16:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:16:34,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:34,178 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 72, 1, 1, 1, 1] [2018-09-26 08:16:34,179 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:34,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:34,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1525499789, now seen corresponding path program 144 times [2018-09-26 08:16:34,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 5402 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:34,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:34,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:16:34,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:16:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:16:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:16:34,520 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 78 states. [2018-09-26 08:16:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:34,868 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-09-26 08:16:34,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:16:34,868 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 296 [2018-09-26 08:16:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:34,869 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:16:34,869 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:16:34,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5476 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8627, Invalid=14325, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:16:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:16:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2018-09-26 08:16:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:16:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-09-26 08:16:35,055 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 296 [2018-09-26 08:16:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:35,055 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-09-26 08:16:35,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:16:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-09-26 08:16:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:16:35,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:35,057 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-09-26 08:16:35,057 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:35,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1421516049, now seen corresponding path program 145 times [2018-09-26 08:16:35,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 5402 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:35,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:35,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:16:35,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:16:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:16:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5699, Invalid=16651, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:16:35,545 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 150 states. [2018-09-26 08:16:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:36,831 INFO L93 Difference]: Finished difference Result 452 states and 454 transitions. [2018-09-26 08:16:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:16:36,831 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-09-26 08:16:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:36,832 INFO L225 Difference]: With dead ends: 452 [2018-09-26 08:16:36,832 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:16:36,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8030 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11397, Invalid=38555, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:16:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:16:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 08:16:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:16:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-09-26 08:16:36,940 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 298 [2018-09-26 08:16:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:36,940 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-09-26 08:16:36,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:16:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-09-26 08:16:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:16:36,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:36,941 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 73, 1, 1, 1, 1] [2018-09-26 08:16:36,941 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:36,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash -476709591, now seen corresponding path program 146 times [2018-09-26 08:16:36,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10952 backedges. 5550 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:37,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:37,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:16:37,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:16:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:16:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3005, Invalid=3157, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:16:37,256 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 79 states. [2018-09-26 08:16:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:37,635 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-09-26 08:16:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:16:37,635 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 300 [2018-09-26 08:16:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:37,636 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:16:37,636 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:16:37,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8856, Invalid=14706, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:16:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:16:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-09-26 08:16:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:16:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-09-26 08:16:37,743 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 300 [2018-09-26 08:16:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:37,744 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-09-26 08:16:37,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:16:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-09-26 08:16:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:16:37,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:37,745 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-09-26 08:16:37,745 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:37,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1443516965, now seen corresponding path program 147 times [2018-09-26 08:16:37,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 5550 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:38,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:38,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:16:38,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:16:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:16:38,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5851, Invalid=17101, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:16:38,282 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 152 states. [2018-09-26 08:16:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:39,234 INFO L93 Difference]: Finished difference Result 458 states and 460 transitions. [2018-09-26 08:16:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:16:39,234 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-09-26 08:16:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:39,235 INFO L225 Difference]: With dead ends: 458 [2018-09-26 08:16:39,235 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:16:39,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11701, Invalid=39601, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:16:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:16:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:16:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:16:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-09-26 08:16:39,344 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 302 [2018-09-26 08:16:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:39,344 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-09-26 08:16:39,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:16:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-09-26 08:16:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:16:39,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:39,345 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 74, 1, 1, 1, 1] [2018-09-26 08:16:39,345 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:39,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1672429407, now seen corresponding path program 148 times [2018-09-26 08:16:39,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 11250 backedges. 5700 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:39,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:39,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:16:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:16:39,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:16:39,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:16:39,653 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 80 states. [2018-09-26 08:16:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:40,019 INFO L93 Difference]: Finished difference Result 313 states and 314 transitions. [2018-09-26 08:16:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:16:40,019 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 304 [2018-09-26 08:16:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:40,020 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:16:40,020 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:16:40,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5776 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9088, Invalid=15092, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:16:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:16:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2018-09-26 08:16:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:16:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-09-26 08:16:40,127 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 304 [2018-09-26 08:16:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:40,127 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-09-26 08:16:40,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:16:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-09-26 08:16:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:16:40,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:40,128 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-09-26 08:16:40,128 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:40,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash 886824667, now seen corresponding path program 149 times [2018-09-26 08:16:40,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5700 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:40,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:40,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:16:40,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:16:40,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:16:40,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=17557, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:16:40,642 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 154 states. [2018-09-26 08:16:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:41,485 INFO L93 Difference]: Finished difference Result 464 states and 466 transitions. [2018-09-26 08:16:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:16:41,485 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-09-26 08:16:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:41,486 INFO L225 Difference]: With dead ends: 464 [2018-09-26 08:16:41,486 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:16:41,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12009, Invalid=40661, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:16:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:16:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-09-26 08:16:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:16:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-09-26 08:16:41,684 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 306 [2018-09-26 08:16:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:41,684 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-09-26 08:16:41,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:16:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-09-26 08:16:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:16:41,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:41,686 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 75, 1, 1, 1, 1] [2018-09-26 08:16:41,686 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:41,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -546070763, now seen corresponding path program 150 times [2018-09-26 08:16:41,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11552 backedges. 5852 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:42,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:42,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:16:42,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:16:42,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:16:42,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3162, Invalid=3318, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:16:42,283 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 81 states. [2018-09-26 08:16:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:42,666 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-09-26 08:16:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:16:42,667 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 308 [2018-09-26 08:16:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:42,667 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:16:42,668 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:16:42,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5929 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9323, Invalid=15483, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:16:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:16:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2018-09-26 08:16:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:16:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-09-26 08:16:42,781 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 308 [2018-09-26 08:16:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-09-26 08:16:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:16:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-09-26 08:16:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:16:42,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,782 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-09-26 08:16:42,782 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash -788059887, now seen corresponding path program 151 times [2018-09-26 08:16:42,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5852 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:16:43,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:16:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:16:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6161, Invalid=18019, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:16:43,308 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 156 states. [2018-09-26 08:16:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,331 INFO L93 Difference]: Finished difference Result 470 states and 472 transitions. [2018-09-26 08:16:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:16:44,331 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-09-26 08:16:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,332 INFO L225 Difference]: With dead ends: 470 [2018-09-26 08:16:44,332 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:16:44,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12321, Invalid=41735, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:16:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:16:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-09-26 08:16:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:16:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-09-26 08:16:44,450 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 310 [2018-09-26 08:16:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,450 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-09-26 08:16:44,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:16:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-09-26 08:16:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:16:44,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,451 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 76, 1, 1, 1, 1] [2018-09-26 08:16:44,451 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash -319800245, now seen corresponding path program 152 times [2018-09-26 08:16:44,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 6006 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:44,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:16:44,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:16:44,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:16:44,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=3400, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:16:44,793 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 82 states. [2018-09-26 08:16:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,217 INFO L93 Difference]: Finished difference Result 321 states and 322 transitions. [2018-09-26 08:16:45,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:16:45,217 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 312 [2018-09-26 08:16:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,218 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:16:45,218 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:16:45,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9561, Invalid=15879, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:16:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:16:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-09-26 08:16:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:16:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-09-26 08:16:45,336 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 312 [2018-09-26 08:16:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,337 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-09-26 08:16:45,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:16:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-09-26 08:16:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:16:45,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,338 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-09-26 08:16:45,338 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1909543111, now seen corresponding path program 153 times [2018-09-26 08:16:45,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12012 backedges. 6006 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:16:45,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:16:45,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:16:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6319, Invalid=18487, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:16:45,953 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 158 states. [2018-09-26 08:16:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,387 INFO L93 Difference]: Finished difference Result 476 states and 478 transitions. [2018-09-26 08:16:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:16:47,387 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-09-26 08:16:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,388 INFO L225 Difference]: With dead ends: 476 [2018-09-26 08:16:47,388 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:16:47,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8932 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12637, Invalid=42823, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:16:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:16:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-09-26 08:16:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-09-26 08:16:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-09-26 08:16:47,603 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 314 [2018-09-26 08:16:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:47,603 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-09-26 08:16:47,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:16:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-09-26 08:16:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-26 08:16:47,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:47,605 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 77, 1, 1, 1, 1] [2018-09-26 08:16:47,605 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:47,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2144717055, now seen corresponding path program 154 times [2018-09-26 08:16:47,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12168 backedges. 6162 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:16:48,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:16:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:16:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3323, Invalid=3483, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:16:48,109 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 83 states. [2018-09-26 08:16:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,523 INFO L93 Difference]: Finished difference Result 325 states and 326 transitions. [2018-09-26 08:16:48,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:16:48,523 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 316 [2018-09-26 08:16:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,524 INFO L225 Difference]: With dead ends: 325 [2018-09-26 08:16:48,524 INFO L226 Difference]: Without dead ends: 323 [2018-09-26 08:16:48,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9802, Invalid=16280, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:16:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-09-26 08:16:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2018-09-26 08:16:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:16:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-09-26 08:16:48,644 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 316 [2018-09-26 08:16:48,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,644 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-09-26 08:16:48,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:16:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-09-26 08:16:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-26 08:16:48,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,645 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1, 1, 1] [2018-09-26 08:16:48,646 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 511145469, now seen corresponding path program 155 times [2018-09-26 08:16:48,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6162 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:49,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:49,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:16:49,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:16:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:16:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6479, Invalid=18961, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:16:49,218 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 160 states. [2018-09-26 08:16:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,740 INFO L93 Difference]: Finished difference Result 482 states and 484 transitions. [2018-09-26 08:16:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:16:50,740 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-09-26 08:16:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,741 INFO L225 Difference]: With dead ends: 482 [2018-09-26 08:16:50,741 INFO L226 Difference]: Without dead ends: 321 [2018-09-26 08:16:50,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12957, Invalid=43925, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:16:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-09-26 08:16:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-09-26 08:16:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:16:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-09-26 08:16:50,858 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 318 [2018-09-26 08:16:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,859 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-09-26 08:16:50,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:16:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-09-26 08:16:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:16:50,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,860 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 78, 1, 1, 1, 1] [2018-09-26 08:16:50,860 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash -316756169, now seen corresponding path program 156 times [2018-09-26 08:16:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 6320 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:51,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:51,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:16:51,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:16:51,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:16:51,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:16:51,217 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 84 states. [2018-09-26 08:16:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:51,645 INFO L93 Difference]: Finished difference Result 329 states and 330 transitions. [2018-09-26 08:16:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:16:51,645 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 320 [2018-09-26 08:16:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:51,646 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:16:51,646 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 08:16:51,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6400 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10046, Invalid=16686, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:16:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 08:16:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2018-09-26 08:16:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-26 08:16:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-09-26 08:16:51,770 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 320 [2018-09-26 08:16:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:51,771 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-09-26 08:16:51,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:16:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-09-26 08:16:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-26 08:16:51,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:51,772 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1, 1, 1] [2018-09-26 08:16:51,772 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:51,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash 539932851, now seen corresponding path program 157 times [2018-09-26 08:16:51,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6320 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:52,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:52,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:16:52,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:16:52,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:16:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6641, Invalid=19441, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:16:52,356 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 162 states. [2018-09-26 08:16:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:53,962 INFO L93 Difference]: Finished difference Result 488 states and 490 transitions. [2018-09-26 08:16:53,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:16:53,962 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-09-26 08:16:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:53,963 INFO L225 Difference]: With dead ends: 488 [2018-09-26 08:16:53,963 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:16:53,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9401 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13281, Invalid=45041, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:16:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:16:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-09-26 08:16:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 08:16:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-09-26 08:16:54,088 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 322 [2018-09-26 08:16:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,088 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-09-26 08:16:54,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:16:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-09-26 08:16:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-26 08:16:54,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,089 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 79, 1, 1, 1, 1] [2018-09-26 08:16:54,090 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1774372077, now seen corresponding path program 158 times [2018-09-26 08:16:54,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12800 backedges. 6480 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:54,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:54,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:16:54,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:16:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:16:54,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3488, Invalid=3652, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:16:54,502 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 85 states. [2018-09-26 08:16:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,923 INFO L93 Difference]: Finished difference Result 333 states and 334 transitions. [2018-09-26 08:16:54,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:16:54,923 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 324 [2018-09-26 08:16:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,923 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:16:54,924 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:16:54,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6561 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10293, Invalid=17097, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:16:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:16:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-09-26 08:16:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-26 08:16:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-09-26 08:16:55,050 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 324 [2018-09-26 08:16:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:55,051 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-09-26 08:16:55,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:16:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-09-26 08:16:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-26 08:16:55,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:55,052 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1, 1, 1] [2018-09-26 08:16:55,052 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:55,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash 69482729, now seen corresponding path program 159 times [2018-09-26 08:16:55,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6480 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:55,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:55,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:16:55,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:16:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:16:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6805, Invalid=19927, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:16:55,644 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 164 states. [2018-09-26 08:16:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:56,618 INFO L93 Difference]: Finished difference Result 494 states and 496 transitions. [2018-09-26 08:16:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:16:56,618 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-09-26 08:16:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:56,619 INFO L225 Difference]: With dead ends: 494 [2018-09-26 08:16:56,619 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:16:56,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9640 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13609, Invalid=46171, Unknown=0, NotChecked=0, Total=59780 [2018-09-26 08:16:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:16:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-09-26 08:16:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-09-26 08:16:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-09-26 08:16:56,748 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 326 [2018-09-26 08:16:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:56,748 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-09-26 08:16:56,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:16:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-09-26 08:16:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-26 08:16:56,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:56,749 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 80, 1, 1, 1, 1] [2018-09-26 08:16:56,750 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:56,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 268671011, now seen corresponding path program 160 times [2018-09-26 08:16:56,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13122 backedges. 6642 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:16:57,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:16:57,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:16:57,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:16:57,119 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 86 states. [2018-09-26 08:16:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:57,576 INFO L93 Difference]: Finished difference Result 337 states and 338 transitions. [2018-09-26 08:16:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:16:57,577 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 328 [2018-09-26 08:16:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:57,577 INFO L225 Difference]: With dead ends: 337 [2018-09-26 08:16:57,577 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:16:57,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6724 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10543, Invalid=17513, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:16:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:16:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2018-09-26 08:16:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:16:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-09-26 08:16:57,707 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 328 [2018-09-26 08:16:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:57,707 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-09-26 08:16:57,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:16:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-09-26 08:16:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:16:57,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:57,708 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1, 1, 1] [2018-09-26 08:16:57,708 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:57,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash 494737055, now seen corresponding path program 161 times [2018-09-26 08:16:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 6642 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:58,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:58,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:16:58,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:16:58,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:16:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6971, Invalid=20419, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:16:58,373 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 166 states. [2018-09-26 08:16:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:59,996 INFO L93 Difference]: Finished difference Result 500 states and 502 transitions. [2018-09-26 08:16:59,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:16:59,996 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-09-26 08:16:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:59,997 INFO L225 Difference]: With dead ends: 500 [2018-09-26 08:16:59,997 INFO L226 Difference]: Without dead ends: 333 [2018-09-26 08:17:00,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9882 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13941, Invalid=47315, Unknown=0, NotChecked=0, Total=61256 [2018-09-26 08:17:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-09-26 08:17:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-09-26 08:17:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-09-26 08:17:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-09-26 08:17:00,130 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 330 [2018-09-26 08:17:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:00,130 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-09-26 08:17:00,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:17:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-09-26 08:17:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-26 08:17:00,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:00,131 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 81, 1, 1, 1, 1] [2018-09-26 08:17:00,131 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:00,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1606830297, now seen corresponding path program 162 times [2018-09-26 08:17:00,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13448 backedges. 6806 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:00,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:00,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:17:00,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:17:00,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:17:00,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3657, Invalid=3825, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:17:00,510 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 87 states. [2018-09-26 08:17:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:00,960 INFO L93 Difference]: Finished difference Result 341 states and 342 transitions. [2018-09-26 08:17:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:17:00,960 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 332 [2018-09-26 08:17:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:00,961 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:17:00,961 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:17:00,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6889 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10796, Invalid=17934, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:17:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:17:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-09-26 08:17:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-26 08:17:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-09-26 08:17:01,196 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 332 [2018-09-26 08:17:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:01,197 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-09-26 08:17:01,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:17:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-09-26 08:17:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-09-26 08:17:01,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:01,199 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1, 1, 1] [2018-09-26 08:17:01,199 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:01,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2024377899, now seen corresponding path program 163 times [2018-09-26 08:17:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 6806 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:01,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:01,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:17:01,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:17:01,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:17:01,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7139, Invalid=20917, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:17:01,881 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 168 states. [2018-09-26 08:17:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:03,513 INFO L93 Difference]: Finished difference Result 506 states and 508 transitions. [2018-09-26 08:17:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:17:03,513 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-09-26 08:17:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:03,514 INFO L225 Difference]: With dead ends: 506 [2018-09-26 08:17:03,514 INFO L226 Difference]: Without dead ends: 337 [2018-09-26 08:17:03,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14277, Invalid=48473, Unknown=0, NotChecked=0, Total=62750 [2018-09-26 08:17:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-09-26 08:17:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-09-26 08:17:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:17:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-09-26 08:17:03,649 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 334 [2018-09-26 08:17:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:03,649 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-09-26 08:17:03,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:17:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-09-26 08:17:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-26 08:17:03,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:03,650 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 82, 1, 1, 1, 1] [2018-09-26 08:17:03,650 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:03,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1088943887, now seen corresponding path program 164 times [2018-09-26 08:17:03,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13778 backedges. 6972 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:04,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:04,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:17:04,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:17:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:17:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3743, Invalid=3913, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:17:04,025 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 88 states. [2018-09-26 08:17:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:04,491 INFO L93 Difference]: Finished difference Result 345 states and 346 transitions. [2018-09-26 08:17:04,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:17:04,492 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 336 [2018-09-26 08:17:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:04,492 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:17:04,492 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 08:17:04,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7056 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11052, Invalid=18360, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:17:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 08:17:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2018-09-26 08:17:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:17:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-09-26 08:17:04,626 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 336 [2018-09-26 08:17:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:04,627 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-09-26 08:17:04,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:17:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-09-26 08:17:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:17:04,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:04,628 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1, 1, 1] [2018-09-26 08:17:04,628 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:04,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1497011573, now seen corresponding path program 165 times [2018-09-26 08:17:04,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 6972 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:05,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:05,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:17:05,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:17:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:17:05,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7309, Invalid=21421, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:17:05,250 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 170 states. [2018-09-26 08:17:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:06,868 INFO L93 Difference]: Finished difference Result 512 states and 514 transitions. [2018-09-26 08:17:06,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:17:06,868 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-09-26 08:17:06,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:06,869 INFO L225 Difference]: With dead ends: 512 [2018-09-26 08:17:06,869 INFO L226 Difference]: Without dead ends: 341 [2018-09-26 08:17:06,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14617, Invalid=49645, Unknown=0, NotChecked=0, Total=64262 [2018-09-26 08:17:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-09-26 08:17:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-09-26 08:17:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:17:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-09-26 08:17:07,004 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 338 [2018-09-26 08:17:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:07,004 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-09-26 08:17:07,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:17:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-09-26 08:17:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:17:07,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:07,005 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 83, 1, 1, 1, 1] [2018-09-26 08:17:07,005 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:07,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2059550011, now seen corresponding path program 166 times [2018-09-26 08:17:07,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14112 backedges. 7140 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:07,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:07,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:17:07,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:17:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:17:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3830, Invalid=4002, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:17:07,398 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 89 states. [2018-09-26 08:17:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:07,856 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-09-26 08:17:07,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:17:07,856 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 340 [2018-09-26 08:17:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:07,856 INFO L225 Difference]: With dead ends: 349 [2018-09-26 08:17:07,857 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 08:17:07,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11311, Invalid=18791, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:17:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 08:17:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-09-26 08:17:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:17:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-09-26 08:17:07,995 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 340 [2018-09-26 08:17:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:07,995 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-09-26 08:17:07,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:17:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-09-26 08:17:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-09-26 08:17:07,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:07,996 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1, 1, 1] [2018-09-26 08:17:07,996 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:07,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash 752296129, now seen corresponding path program 167 times [2018-09-26 08:17:07,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 7140 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:08,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:08,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:17:08,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:17:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:17:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7481, Invalid=21931, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:17:08,643 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 172 states. [2018-09-26 08:17:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:10,426 INFO L93 Difference]: Finished difference Result 518 states and 520 transitions. [2018-09-26 08:17:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:17:10,426 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-09-26 08:17:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:10,426 INFO L225 Difference]: With dead ends: 518 [2018-09-26 08:17:10,427 INFO L226 Difference]: Without dead ends: 345 [2018-09-26 08:17:10,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10626 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14961, Invalid=50831, Unknown=0, NotChecked=0, Total=65792 [2018-09-26 08:17:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-09-26 08:17:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-09-26 08:17:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 08:17:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-09-26 08:17:10,568 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 342 [2018-09-26 08:17:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:10,568 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-09-26 08:17:10,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:17:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-09-26 08:17:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-26 08:17:10,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:10,570 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 84, 1, 1, 1, 1] [2018-09-26 08:17:10,571 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:10,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -359347205, now seen corresponding path program 168 times [2018-09-26 08:17:10,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14450 backedges. 7310 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:11,067 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:11,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:17:11,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:17:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:17:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:17:11,068 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 90 states. [2018-09-26 08:17:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:11,529 INFO L93 Difference]: Finished difference Result 353 states and 354 transitions. [2018-09-26 08:17:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:17:11,529 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 344 [2018-09-26 08:17:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:11,530 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:17:11,530 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:17:11,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11573, Invalid=19227, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:17:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:17:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2018-09-26 08:17:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-09-26 08:17:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-09-26 08:17:11,666 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 344 [2018-09-26 08:17:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:11,666 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-09-26 08:17:11,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:17:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-09-26 08:17:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-26 08:17:11,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:11,667 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1, 1, 1] [2018-09-26 08:17:11,668 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:11,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1735347081, now seen corresponding path program 169 times [2018-09-26 08:17:11,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 7310 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:12,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:12,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:17:12,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:17:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:17:12,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7655, Invalid=22447, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:17:12,297 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 174 states. [2018-09-26 08:17:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:13,828 INFO L93 Difference]: Finished difference Result 524 states and 526 transitions. [2018-09-26 08:17:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:17:13,828 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-09-26 08:17:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:13,829 INFO L225 Difference]: With dead ends: 524 [2018-09-26 08:17:13,829 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:17:13,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10880 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15309, Invalid=52031, Unknown=0, NotChecked=0, Total=67340 [2018-09-26 08:17:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:17:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-09-26 08:17:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 08:17:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-09-26 08:17:14,082 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 346 [2018-09-26 08:17:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:14,084 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-09-26 08:17:14,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:17:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-09-26 08:17:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-09-26 08:17:14,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:14,086 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 85, 1, 1, 1, 1] [2018-09-26 08:17:14,086 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1666043215, now seen corresponding path program 170 times [2018-09-26 08:17:14,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14792 backedges. 7482 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:14,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:14,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:17:14,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:17:14,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:17:14,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4007, Invalid=4183, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:17:14,516 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 91 states. [2018-09-26 08:17:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:15,036 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-09-26 08:17:15,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:17:15,037 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 348 [2018-09-26 08:17:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:15,037 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:17:15,037 INFO L226 Difference]: Without dead ends: 355 [2018-09-26 08:17:15,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7569 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11838, Invalid=19668, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:17:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-09-26 08:17:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-09-26 08:17:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 08:17:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-09-26 08:17:15,180 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 348 [2018-09-26 08:17:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:15,181 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-09-26 08:17:15,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:17:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-09-26 08:17:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-26 08:17:15,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:15,182 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1, 1, 1] [2018-09-26 08:17:15,183 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:15,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 955205037, now seen corresponding path program 171 times [2018-09-26 08:17:15,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7482 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:15,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:15,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:17:15,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:17:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:17:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7831, Invalid=22969, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:17:15,806 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 176 states. [2018-09-26 08:17:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:18,149 INFO L93 Difference]: Finished difference Result 530 states and 532 transitions. [2018-09-26 08:17:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:17:18,149 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 350 [2018-09-26 08:17:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:18,150 INFO L225 Difference]: With dead ends: 530 [2018-09-26 08:17:18,150 INFO L226 Difference]: Without dead ends: 353 [2018-09-26 08:17:18,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15661, Invalid=53245, Unknown=0, NotChecked=0, Total=68906 [2018-09-26 08:17:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-09-26 08:17:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-09-26 08:17:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-09-26 08:17:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-09-26 08:17:18,307 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 350 [2018-09-26 08:17:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:18,307 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-09-26 08:17:18,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:17:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-09-26 08:17:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-26 08:17:18,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:18,308 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 86, 1, 1, 1, 1] [2018-09-26 08:17:18,308 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:18,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash 928192231, now seen corresponding path program 172 times [2018-09-26 08:17:18,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15138 backedges. 7656 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:18,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:18,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:17:18,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:17:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:17:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:17:18,749 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 92 states. [2018-09-26 08:17:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:19,223 INFO L93 Difference]: Finished difference Result 361 states and 362 transitions. [2018-09-26 08:17:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:17:19,223 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 352 [2018-09-26 08:17:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:19,224 INFO L225 Difference]: With dead ends: 361 [2018-09-26 08:17:19,224 INFO L226 Difference]: Without dead ends: 359 [2018-09-26 08:17:19,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7744 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12106, Invalid=20114, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:17:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-09-26 08:17:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2018-09-26 08:17:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-26 08:17:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-09-26 08:17:19,371 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 352 [2018-09-26 08:17:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-09-26 08:17:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:17:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-09-26 08:17:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-26 08:17:19,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:19,372 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1, 1, 1] [2018-09-26 08:17:19,373 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:19,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1360530333, now seen corresponding path program 173 times [2018-09-26 08:17:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 15312 backedges. 7656 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:17:20,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:17:20,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:17:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8009, Invalid=23497, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:17:20,109 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 178 states. [2018-09-26 08:17:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,216 INFO L93 Difference]: Finished difference Result 536 states and 538 transitions. [2018-09-26 08:17:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:17:22,216 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 354 [2018-09-26 08:17:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,217 INFO L225 Difference]: With dead ends: 536 [2018-09-26 08:17:22,217 INFO L226 Difference]: Without dead ends: 357 [2018-09-26 08:17:22,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11397 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16017, Invalid=54473, Unknown=0, NotChecked=0, Total=70490 [2018-09-26 08:17:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-09-26 08:17:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-09-26 08:17:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-09-26 08:17:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-09-26 08:17:22,368 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 354 [2018-09-26 08:17:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,369 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-09-26 08:17:22,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:17:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-09-26 08:17:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-09-26 08:17:22,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,370 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 87, 1, 1, 1, 1] [2018-09-26 08:17:22,370 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1210882205, now seen corresponding path program 174 times [2018-09-26 08:17:22,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15488 backedges. 7832 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:22,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:22,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:17:22,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:17:22,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:17:22,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4188, Invalid=4368, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:17:22,799 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 93 states. [2018-09-26 08:17:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:23,296 INFO L93 Difference]: Finished difference Result 365 states and 366 transitions. [2018-09-26 08:17:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:17:23,296 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 356 [2018-09-26 08:17:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:23,297 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:17:23,297 INFO L226 Difference]: Without dead ends: 363 [2018-09-26 08:17:23,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7921 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12377, Invalid=20565, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:17:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-26 08:17:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2018-09-26 08:17:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-09-26 08:17:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-09-26 08:17:23,449 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 356 [2018-09-26 08:17:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:23,449 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-09-26 08:17:23,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:17:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-09-26 08:17:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-09-26 08:17:23,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:23,451 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1, 1, 1] [2018-09-26 08:17:23,451 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:23,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash -278404967, now seen corresponding path program 175 times [2018-09-26 08:17:23,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15664 backedges. 7832 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:24,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:24,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:17:24,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:17:24,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:17:24,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8189, Invalid=24031, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:17:24,201 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 180 states. [2018-09-26 08:17:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:26,365 INFO L93 Difference]: Finished difference Result 542 states and 544 transitions. [2018-09-26 08:17:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:17:26,365 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 358 [2018-09-26 08:17:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:26,366 INFO L225 Difference]: With dead ends: 542 [2018-09-26 08:17:26,366 INFO L226 Difference]: Without dead ends: 361 [2018-09-26 08:17:26,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16377, Invalid=55715, Unknown=0, NotChecked=0, Total=72092 [2018-09-26 08:17:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-09-26 08:17:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-09-26 08:17:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-09-26 08:17:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-09-26 08:17:26,520 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 358 [2018-09-26 08:17:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:26,520 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-09-26 08:17:26,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:17:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-09-26 08:17:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-26 08:17:26,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:26,521 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 88, 1, 1, 1, 1] [2018-09-26 08:17:26,522 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:26,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1357633491, now seen corresponding path program 176 times [2018-09-26 08:17:26,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15842 backedges. 8010 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:26,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:26,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:17:26,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:17:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:17:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4280, Invalid=4462, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:17:26,954 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 94 states. [2018-09-26 08:17:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:27,464 INFO L93 Difference]: Finished difference Result 369 states and 370 transitions. [2018-09-26 08:17:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:17:27,465 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 360 [2018-09-26 08:17:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:27,465 INFO L225 Difference]: With dead ends: 369 [2018-09-26 08:17:27,465 INFO L226 Difference]: Without dead ends: 367 [2018-09-26 08:17:27,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12651, Invalid=21021, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:17:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-09-26 08:17:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2018-09-26 08:17:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-09-26 08:17:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-09-26 08:17:27,621 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 360 [2018-09-26 08:17:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:27,621 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-09-26 08:17:27,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:17:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-09-26 08:17:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-09-26 08:17:27,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:27,622 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1, 1, 1] [2018-09-26 08:17:27,623 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:27,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:27,623 INFO L82 PathProgramCache]: Analyzing trace with hash -984339889, now seen corresponding path program 177 times [2018-09-26 08:17:27,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 8010 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:28,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:28,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:17:28,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:17:28,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:17:28,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8371, Invalid=24571, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:17:28,355 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 182 states. [2018-09-26 08:17:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:29,916 INFO L93 Difference]: Finished difference Result 548 states and 550 transitions. [2018-09-26 08:17:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:17:29,916 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 362 [2018-09-26 08:17:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:29,916 INFO L225 Difference]: With dead ends: 548 [2018-09-26 08:17:29,917 INFO L226 Difference]: Without dead ends: 365 [2018-09-26 08:17:29,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11926 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16741, Invalid=56971, Unknown=0, NotChecked=0, Total=73712 [2018-09-26 08:17:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-09-26 08:17:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-09-26 08:17:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-09-26 08:17:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-09-26 08:17:30,073 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 362 [2018-09-26 08:17:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:30,074 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-09-26 08:17:30,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:17:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-09-26 08:17:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-26 08:17:30,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:30,075 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 90, 89, 1, 1, 1, 1] [2018-09-26 08:17:30,075 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:30,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:30,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1228272777, now seen corresponding path program 178 times [2018-09-26 08:17:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16200 backedges. 8190 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:30,534 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:30,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:17:30,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:17:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:17:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4373, Invalid=4557, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:17:30,535 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 95 states. [2018-09-26 08:17:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:31,034 INFO L93 Difference]: Finished difference Result 373 states and 374 transitions. [2018-09-26 08:17:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:17:31,034 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 364 [2018-09-26 08:17:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:31,035 INFO L225 Difference]: With dead ends: 373 [2018-09-26 08:17:31,035 INFO L226 Difference]: Without dead ends: 371 [2018-09-26 08:17:31,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12928, Invalid=21482, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:17:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-09-26 08:17:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 367. [2018-09-26 08:17:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-09-26 08:17:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-09-26 08:17:31,193 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 364 [2018-09-26 08:17:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:31,194 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-09-26 08:17:31,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:17:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-09-26 08:17:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-09-26 08:17:31,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:31,195 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1, 1, 1] [2018-09-26 08:17:31,195 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:31,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash -745934459, now seen corresponding path program 179 times [2018-09-26 08:17:31,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 8190 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:31,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:31,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:17:31,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:17:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:17:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8555, Invalid=25117, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:17:32,000 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 184 states. [2018-09-26 08:17:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:34,021 INFO L93 Difference]: Finished difference Result 554 states and 556 transitions. [2018-09-26 08:17:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:17:34,021 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 366 [2018-09-26 08:17:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:34,022 INFO L225 Difference]: With dead ends: 554 [2018-09-26 08:17:34,022 INFO L226 Difference]: Without dead ends: 369 [2018-09-26 08:17:34,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17109, Invalid=58241, Unknown=0, NotChecked=0, Total=75350 [2018-09-26 08:17:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-09-26 08:17:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-09-26 08:17:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-09-26 08:17:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-09-26 08:17:34,181 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 366 [2018-09-26 08:17:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:34,181 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-09-26 08:17:34,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:17:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-09-26 08:17:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-09-26 08:17:34,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:34,182 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 91, 90, 1, 1, 1, 1] [2018-09-26 08:17:34,183 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:34,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1599598913, now seen corresponding path program 180 times [2018-09-26 08:17:34,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16562 backedges. 8372 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:34,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:34,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:17:34,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:17:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:17:34,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:17:34,631 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 96 states. [2018-09-26 08:17:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:35,145 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-09-26 08:17:35,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:17:35,146 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 368 [2018-09-26 08:17:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:35,146 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:17:35,147 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:17:35,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8464 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13208, Invalid=21948, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:17:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:17:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2018-09-26 08:17:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 08:17:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-09-26 08:17:35,330 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 368 [2018-09-26 08:17:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:35,330 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-09-26 08:17:35,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:17:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-09-26 08:17:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-09-26 08:17:35,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:35,332 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1, 1, 1] [2018-09-26 08:17:35,332 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:35,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 383669819, now seen corresponding path program 181 times [2018-09-26 08:17:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16744 backedges. 8372 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:36,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:36,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:17:36,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:17:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:17:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8741, Invalid=25669, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:17:36,110 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 186 states. [2018-09-26 08:17:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,744 INFO L93 Difference]: Finished difference Result 560 states and 562 transitions. [2018-09-26 08:17:37,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:17:37,744 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 370 [2018-09-26 08:17:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,745 INFO L225 Difference]: With dead ends: 560 [2018-09-26 08:17:37,745 INFO L226 Difference]: Without dead ends: 373 [2018-09-26 08:17:37,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12467 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17481, Invalid=59525, Unknown=0, NotChecked=0, Total=77006 [2018-09-26 08:17:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-09-26 08:17:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-09-26 08:17:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-09-26 08:17:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-09-26 08:17:37,909 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 370 [2018-09-26 08:17:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,909 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-09-26 08:17:37,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:17:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-09-26 08:17:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-09-26 08:17:37,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,910 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 91, 1, 1, 1, 1] [2018-09-26 08:17:37,911 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1059633547, now seen corresponding path program 182 times [2018-09-26 08:17:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16928 backedges. 8556 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:38,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:38,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:17:38,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:17:38,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:17:38,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4562, Invalid=4750, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:17:38,368 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 97 states. [2018-09-26 08:17:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,896 INFO L93 Difference]: Finished difference Result 381 states and 382 transitions. [2018-09-26 08:17:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:17:38,897 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 372 [2018-09-26 08:17:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,897 INFO L225 Difference]: With dead ends: 381 [2018-09-26 08:17:38,897 INFO L226 Difference]: Without dead ends: 379 [2018-09-26 08:17:38,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8649 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13491, Invalid=22419, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:17:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-09-26 08:17:39,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2018-09-26 08:17:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-09-26 08:17:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-09-26 08:17:39,063 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 372 [2018-09-26 08:17:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,063 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-09-26 08:17:39,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:17:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-09-26 08:17:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-09-26 08:17:39,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,065 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1, 1, 1] [2018-09-26 08:17:39,065 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash -400656271, now seen corresponding path program 183 times [2018-09-26 08:17:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 8556 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:39,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:17:39,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:17:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:17:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8929, Invalid=26227, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:17:39,873 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 188 states. [2018-09-26 08:17:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:42,093 INFO L93 Difference]: Finished difference Result 566 states and 568 transitions. [2018-09-26 08:17:42,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:17:42,093 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 374 [2018-09-26 08:17:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:42,094 INFO L225 Difference]: With dead ends: 566 [2018-09-26 08:17:42,094 INFO L226 Difference]: Without dead ends: 377 [2018-09-26 08:17:42,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17857, Invalid=60823, Unknown=0, NotChecked=0, Total=78680 [2018-09-26 08:17:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-09-26 08:17:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-09-26 08:17:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-09-26 08:17:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-09-26 08:17:42,268 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 374 [2018-09-26 08:17:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:42,268 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-09-26 08:17:42,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:17:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-09-26 08:17:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-09-26 08:17:42,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:42,270 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 93, 92, 1, 1, 1, 1] [2018-09-26 08:17:42,270 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:42,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 256949163, now seen corresponding path program 184 times [2018-09-26 08:17:42,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17298 backedges. 8742 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:42,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:42,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:17:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:17:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:17:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:17:42,741 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 98 states. [2018-09-26 08:17:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:43,283 INFO L93 Difference]: Finished difference Result 385 states and 386 transitions. [2018-09-26 08:17:43,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:17:43,284 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 376 [2018-09-26 08:17:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:43,284 INFO L225 Difference]: With dead ends: 385 [2018-09-26 08:17:43,284 INFO L226 Difference]: Without dead ends: 383 [2018-09-26 08:17:43,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8836 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13777, Invalid=22895, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:17:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-26 08:17:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2018-09-26 08:17:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-09-26 08:17:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-09-26 08:17:43,454 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 376 [2018-09-26 08:17:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:43,454 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-09-26 08:17:43,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:17:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-09-26 08:17:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-09-26 08:17:43,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:43,456 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1, 1, 1] [2018-09-26 08:17:43,456 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:43,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2114943015, now seen corresponding path program 185 times [2018-09-26 08:17:43,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 8742 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:44,258 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:44,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:17:44,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:17:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:17:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:17:44,261 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 190 states. [2018-09-26 08:17:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:46,563 INFO L93 Difference]: Finished difference Result 572 states and 574 transitions. [2018-09-26 08:17:46,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:17:46,564 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 378 [2018-09-26 08:17:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:46,564 INFO L225 Difference]: With dead ends: 572 [2018-09-26 08:17:46,564 INFO L226 Difference]: Without dead ends: 381 [2018-09-26 08:17:46,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13020 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18237, Invalid=62135, Unknown=0, NotChecked=0, Total=80372 [2018-09-26 08:17:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-09-26 08:17:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-09-26 08:17:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 08:17:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-09-26 08:17:46,735 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 378 [2018-09-26 08:17:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:46,735 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-09-26 08:17:46,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:17:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-09-26 08:17:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-09-26 08:17:46,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:46,736 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 93, 1, 1, 1, 1] [2018-09-26 08:17:46,736 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:46,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:46,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1872334433, now seen corresponding path program 186 times [2018-09-26 08:17:46,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17672 backedges. 8930 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:47,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:47,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:17:47,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:17:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:17:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=4947, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:17:47,210 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 99 states. [2018-09-26 08:17:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:47,774 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-09-26 08:17:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:17:47,774 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 380 [2018-09-26 08:17:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:47,775 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:17:47,775 INFO L226 Difference]: Without dead ends: 387 [2018-09-26 08:17:47,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9025 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14066, Invalid=23376, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:17:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-26 08:17:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-09-26 08:17:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-26 08:17:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-09-26 08:17:47,945 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 380 [2018-09-26 08:17:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-09-26 08:17:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:17:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-09-26 08:17:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-09-26 08:17:47,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:47,947 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1, 1, 1] [2018-09-26 08:17:47,947 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:47,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -277973667, now seen corresponding path program 187 times [2018-09-26 08:17:47,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 8930 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:48,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:48,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:17:48,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:17:48,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:17:48,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9311, Invalid=27361, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:17:48,741 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 192 states. [2018-09-26 08:17:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:50,623 INFO L93 Difference]: Finished difference Result 578 states and 580 transitions. [2018-09-26 08:17:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:17:50,623 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 382 [2018-09-26 08:17:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:50,624 INFO L225 Difference]: With dead ends: 578 [2018-09-26 08:17:50,624 INFO L226 Difference]: Without dead ends: 385 [2018-09-26 08:17:50,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13301 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18621, Invalid=63461, Unknown=0, NotChecked=0, Total=82082 [2018-09-26 08:17:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-26 08:17:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-09-26 08:17:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-09-26 08:17:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-09-26 08:17:50,798 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 382 [2018-09-26 08:17:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:50,799 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-09-26 08:17:50,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:17:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-09-26 08:17:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-09-26 08:17:50,800 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:50,800 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 95, 94, 1, 1, 1, 1] [2018-09-26 08:17:50,800 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:50,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1160699543, now seen corresponding path program 188 times [2018-09-26 08:17:50,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18050 backedges. 9120 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:51,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:51,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:17:51,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:17:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:17:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4853, Invalid=5047, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:17:51,287 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 100 states. [2018-09-26 08:17:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:51,874 INFO L93 Difference]: Finished difference Result 393 states and 394 transitions. [2018-09-26 08:17:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:17:51,874 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 384 [2018-09-26 08:17:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:51,875 INFO L225 Difference]: With dead ends: 393 [2018-09-26 08:17:51,875 INFO L226 Difference]: Without dead ends: 391 [2018-09-26 08:17:51,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14358, Invalid=23862, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:17:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-09-26 08:17:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 387. [2018-09-26 08:17:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 08:17:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-09-26 08:17:52,051 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 384 [2018-09-26 08:17:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:52,052 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-09-26 08:17:52,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:17:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-09-26 08:17:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-09-26 08:17:52,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:52,054 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1, 1, 1] [2018-09-26 08:17:52,054 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:52,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1259302893, now seen corresponding path program 189 times [2018-09-26 08:17:52,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 9120 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:52,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:52,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:17:52,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:17:52,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:17:52,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9505, Invalid=27937, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:17:52,909 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 194 states. [2018-09-26 08:17:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:54,465 INFO L93 Difference]: Finished difference Result 584 states and 586 transitions. [2018-09-26 08:17:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:17:54,465 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 386 [2018-09-26 08:17:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:54,466 INFO L225 Difference]: With dead ends: 584 [2018-09-26 08:17:54,466 INFO L226 Difference]: Without dead ends: 389 [2018-09-26 08:17:54,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19009, Invalid=64801, Unknown=0, NotChecked=0, Total=83810 [2018-09-26 08:17:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-09-26 08:17:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-09-26 08:17:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-09-26 08:17:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-09-26 08:17:54,646 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 386 [2018-09-26 08:17:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:54,646 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-09-26 08:17:54,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:17:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-09-26 08:17:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-26 08:17:54,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:54,648 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 95, 1, 1, 1, 1] [2018-09-26 08:17:54,648 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:54,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:54,648 INFO L82 PathProgramCache]: Analyzing trace with hash -175780787, now seen corresponding path program 190 times [2018-09-26 08:17:54,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18432 backedges. 9312 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:55,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:55,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:17:55,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:17:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:17:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4952, Invalid=5148, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:17:55,176 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 101 states. [2018-09-26 08:17:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:55,849 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-09-26 08:17:55,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:17:55,849 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 388 [2018-09-26 08:17:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:55,849 INFO L225 Difference]: With dead ends: 397 [2018-09-26 08:17:55,850 INFO L226 Difference]: Without dead ends: 395 [2018-09-26 08:17:55,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9409 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14653, Invalid=24353, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:17:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-26 08:17:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2018-09-26 08:17:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 08:17:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-09-26 08:17:56,090 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 388 [2018-09-26 08:17:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:56,091 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-09-26 08:17:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:17:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-09-26 08:17:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-26 08:17:56,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:56,093 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1, 1, 1] [2018-09-26 08:17:56,093 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:56,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1421678519, now seen corresponding path program 191 times [2018-09-26 08:17:56,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 9312 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:56,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:56,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:17:56,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:17:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:17:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9701, Invalid=28519, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:17:56,887 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 196 states. [2018-09-26 08:17:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:58,808 INFO L93 Difference]: Finished difference Result 590 states and 592 transitions. [2018-09-26 08:17:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:17:58,808 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 390 [2018-09-26 08:17:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:58,809 INFO L225 Difference]: With dead ends: 590 [2018-09-26 08:17:58,809 INFO L226 Difference]: Without dead ends: 393 [2018-09-26 08:17:58,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13872 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19401, Invalid=66155, Unknown=0, NotChecked=0, Total=85556 [2018-09-26 08:17:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-09-26 08:17:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-09-26 08:17:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 08:17:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-09-26 08:17:58,993 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 390 [2018-09-26 08:17:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:58,993 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-09-26 08:17:58,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:17:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-09-26 08:17:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-09-26 08:17:58,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:58,994 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 97, 96, 1, 1, 1, 1] [2018-09-26 08:17:58,994 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:58,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash -368347261, now seen corresponding path program 192 times [2018-09-26 08:17:58,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18818 backedges. 9506 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:59,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:59,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:17:59,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:17:59,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:17:59,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:17:59,506 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 102 states. [2018-09-26 08:18:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:00,144 INFO L93 Difference]: Finished difference Result 401 states and 402 transitions. [2018-09-26 08:18:00,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:18:00,145 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 392 [2018-09-26 08:18:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:00,145 INFO L225 Difference]: With dead ends: 401 [2018-09-26 08:18:00,145 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 08:18:00,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9604 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14951, Invalid=24849, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:18:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 08:18:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2018-09-26 08:18:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-26 08:18:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-09-26 08:18:00,328 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 392 [2018-09-26 08:18:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:00,328 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-09-26 08:18:00,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:18:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-09-26 08:18:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-09-26 08:18:00,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:00,329 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1, 1, 1] [2018-09-26 08:18:00,329 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:00,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1794466305, now seen corresponding path program 193 times [2018-09-26 08:18:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 9506 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:01,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:01,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:18:01,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:18:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:18:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9899, Invalid=29107, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:18:01,152 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 198 states. [2018-09-26 08:18:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:03,041 INFO L93 Difference]: Finished difference Result 596 states and 598 transitions. [2018-09-26 08:18:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:18:03,041 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 394 [2018-09-26 08:18:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:03,042 INFO L225 Difference]: With dead ends: 596 [2018-09-26 08:18:03,042 INFO L226 Difference]: Without dead ends: 397 [2018-09-26 08:18:03,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14162 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19797, Invalid=67523, Unknown=0, NotChecked=0, Total=87320 [2018-09-26 08:18:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-09-26 08:18:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-09-26 08:18:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-26 08:18:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-09-26 08:18:03,229 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 394 [2018-09-26 08:18:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:03,229 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-09-26 08:18:03,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:18:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-09-26 08:18:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-09-26 08:18:03,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:03,230 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 97, 1, 1, 1, 1] [2018-09-26 08:18:03,231 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:03,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:03,231 INFO L82 PathProgramCache]: Analyzing trace with hash 304414777, now seen corresponding path program 194 times [2018-09-26 08:18:03,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 19208 backedges. 9702 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:03,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:03,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:18:03,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:18:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:18:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5153, Invalid=5353, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:18:03,824 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 103 states. [2018-09-26 08:18:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:04,404 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-09-26 08:18:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:18:04,404 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 396 [2018-09-26 08:18:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:04,405 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:18:04,405 INFO L226 Difference]: Without dead ends: 403 [2018-09-26 08:18:04,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9801 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15252, Invalid=25350, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:18:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-09-26 08:18:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2018-09-26 08:18:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-09-26 08:18:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-09-26 08:18:04,594 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 396 [2018-09-26 08:18:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:04,594 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-09-26 08:18:04,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:18:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-09-26 08:18:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-09-26 08:18:04,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:04,596 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1, 1, 1] [2018-09-26 08:18:04,596 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:04,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash 484757813, now seen corresponding path program 195 times [2018-09-26 08:18:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 9702 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:05,424 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:05,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:18:05,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:18:05,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:18:05,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10099, Invalid=29701, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:18:05,428 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 200 states. [2018-09-26 08:18:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:07,537 INFO L93 Difference]: Finished difference Result 602 states and 604 transitions. [2018-09-26 08:18:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:18:07,538 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 398 [2018-09-26 08:18:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:07,538 INFO L225 Difference]: With dead ends: 602 [2018-09-26 08:18:07,538 INFO L226 Difference]: Without dead ends: 401 [2018-09-26 08:18:07,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20197, Invalid=68905, Unknown=0, NotChecked=0, Total=89102 [2018-09-26 08:18:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-09-26 08:18:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-09-26 08:18:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-09-26 08:18:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-09-26 08:18:07,730 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 398 [2018-09-26 08:18:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:07,730 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-09-26 08:18:07,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:18:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-09-26 08:18:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-09-26 08:18:07,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:07,731 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 98, 1, 1, 1, 1] [2018-09-26 08:18:07,731 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:07,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash -449870225, now seen corresponding path program 196 times [2018-09-26 08:18:07,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19602 backedges. 9900 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:08,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:08,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:18:08,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:18:08,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:18:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:18:08,370 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 104 states. [2018-09-26 08:18:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:08,980 INFO L93 Difference]: Finished difference Result 409 states and 410 transitions. [2018-09-26 08:18:08,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:18:08,980 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 400 [2018-09-26 08:18:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:08,981 INFO L225 Difference]: With dead ends: 409 [2018-09-26 08:18:08,981 INFO L226 Difference]: Without dead ends: 407 [2018-09-26 08:18:08,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10000 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15556, Invalid=25856, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:18:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-09-26 08:18:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2018-09-26 08:18:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-09-26 08:18:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-09-26 08:18:09,170 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 400 [2018-09-26 08:18:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:09,171 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-09-26 08:18:09,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:18:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-09-26 08:18:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-09-26 08:18:09,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:09,172 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1, 1, 1] [2018-09-26 08:18:09,172 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:09,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:09,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1466343915, now seen corresponding path program 197 times [2018-09-26 08:18:09,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 9900 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:10,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:10,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:18:10,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:18:10,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:18:10,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10301, Invalid=30301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:18:10,024 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 202 states. [2018-09-26 08:18:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:12,188 INFO L93 Difference]: Finished difference Result 608 states and 610 transitions. [2018-09-26 08:18:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:18:12,188 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 402 [2018-09-26 08:18:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:12,188 INFO L225 Difference]: With dead ends: 608 [2018-09-26 08:18:12,189 INFO L226 Difference]: Without dead ends: 405 [2018-09-26 08:18:12,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14751 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20601, Invalid=70301, Unknown=0, NotChecked=0, Total=90902 [2018-09-26 08:18:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-09-26 08:18:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-09-26 08:18:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-09-26 08:18:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-09-26 08:18:12,379 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 402 [2018-09-26 08:18:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:12,379 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-09-26 08:18:12,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:18:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-09-26 08:18:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-09-26 08:18:12,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:12,380 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 100, 99, 1, 1, 1, 1] [2018-09-26 08:18:12,380 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:12,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:12,381 INFO L82 PathProgramCache]: Analyzing trace with hash -461362651, now seen corresponding path program 198 times [2018-09-26 08:18:12,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20000 backedges. 10100 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:12,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:12,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:18:12,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:18:12,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:18:12,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5358, Invalid=5562, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:18:12,927 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 105 states. [2018-09-26 08:18:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:13,550 INFO L93 Difference]: Finished difference Result 413 states and 414 transitions. [2018-09-26 08:18:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:18:13,551 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2018-09-26 08:18:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:13,551 INFO L225 Difference]: With dead ends: 413 [2018-09-26 08:18:13,551 INFO L226 Difference]: Without dead ends: 411 [2018-09-26 08:18:13,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15863, Invalid=26367, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:18:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-26 08:18:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2018-09-26 08:18:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-09-26 08:18:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-09-26 08:18:13,744 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 404 [2018-09-26 08:18:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:13,744 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-09-26 08:18:13,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:18:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-09-26 08:18:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-09-26 08:18:13,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:13,746 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1, 1, 1] [2018-09-26 08:18:13,746 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:13,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -987942879, now seen corresponding path program 199 times [2018-09-26 08:18:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 10100 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:14,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:14,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:18:14,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:18:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:18:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10505, Invalid=30907, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:18:14,621 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 204 states. [2018-09-26 08:18:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:16,713 INFO L93 Difference]: Finished difference Result 614 states and 616 transitions. [2018-09-26 08:18:16,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:18:16,714 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 406 [2018-09-26 08:18:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:16,715 INFO L225 Difference]: With dead ends: 614 [2018-09-26 08:18:16,715 INFO L226 Difference]: Without dead ends: 409 [2018-09-26 08:18:16,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15050 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21009, Invalid=71711, Unknown=0, NotChecked=0, Total=92720 [2018-09-26 08:18:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-09-26 08:18:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-09-26 08:18:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 08:18:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-09-26 08:18:16,917 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 406 [2018-09-26 08:18:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:16,917 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-09-26 08:18:16,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:18:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-09-26 08:18:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-09-26 08:18:16,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:16,918 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 101, 100, 1, 1, 1, 1] [2018-09-26 08:18:16,919 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:16,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1654387877, now seen corresponding path program 200 times [2018-09-26 08:18:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 20402 backedges. 10302 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:17,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:17,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:18:17,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:18:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:18:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5462, Invalid=5668, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:18:17,477 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 106 states. [2018-09-26 08:18:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:18,127 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-09-26 08:18:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:18:18,127 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 408 [2018-09-26 08:18:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:18,128 INFO L225 Difference]: With dead ends: 417 [2018-09-26 08:18:18,128 INFO L226 Difference]: Without dead ends: 415 [2018-09-26 08:18:18,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10404 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16173, Invalid=26883, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:18:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-09-26 08:18:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2018-09-26 08:18:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 08:18:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-09-26 08:18:18,326 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 408 [2018-09-26 08:18:18,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:18,326 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-09-26 08:18:18,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:18:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-09-26 08:18:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-09-26 08:18:18,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:18,327 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 1, 1, 1, 1] [2018-09-26 08:18:18,328 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:18,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash -728917033, now seen corresponding path program 201 times [2018-09-26 08:18:18,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 10302 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:19,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:19,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:18:19,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:18:19,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:18:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10711, Invalid=31519, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:18:19,286 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 206 states. [2018-09-26 08:18:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:21,244 INFO L93 Difference]: Finished difference Result 620 states and 622 transitions. [2018-09-26 08:18:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:18:21,244 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 410 [2018-09-26 08:18:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:21,244 INFO L225 Difference]: With dead ends: 620 [2018-09-26 08:18:21,245 INFO L226 Difference]: Without dead ends: 413 [2018-09-26 08:18:21,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15352 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21421, Invalid=73135, Unknown=0, NotChecked=0, Total=94556 [2018-09-26 08:18:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-09-26 08:18:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-09-26 08:18:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-09-26 08:18:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-09-26 08:18:21,445 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 410 [2018-09-26 08:18:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:21,445 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-09-26 08:18:21,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:18:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-09-26 08:18:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-09-26 08:18:21,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:21,447 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 102, 101, 1, 1, 1, 1] [2018-09-26 08:18:21,447 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:21,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 723536401, now seen corresponding path program 202 times [2018-09-26 08:18:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20808 backedges. 10506 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:22,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:22,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:18:22,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:18:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:18:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5567, Invalid=5775, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:18:22,042 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 107 states. [2018-09-26 08:18:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:22,709 INFO L93 Difference]: Finished difference Result 421 states and 422 transitions. [2018-09-26 08:18:22,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:18:22,710 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 412 [2018-09-26 08:18:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:22,710 INFO L225 Difference]: With dead ends: 421 [2018-09-26 08:18:22,710 INFO L226 Difference]: Without dead ends: 419 [2018-09-26 08:18:22,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10609 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16486, Invalid=27404, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:18:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-09-26 08:18:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2018-09-26 08:18:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-09-26 08:18:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-09-26 08:18:22,915 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 412 [2018-09-26 08:18:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:22,915 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-09-26 08:18:22,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:18:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-09-26 08:18:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-09-26 08:18:22,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:22,916 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 102, 102, 1, 1, 1, 1] [2018-09-26 08:18:22,916 INFO L423 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:22,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -466287347, now seen corresponding path program 203 times [2018-09-26 08:18:22,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 10506 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:23,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:23,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:18:23,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:18:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:18:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10919, Invalid=32137, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:18:23,895 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 208 states. [2018-09-26 08:18:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:26,114 INFO L93 Difference]: Finished difference Result 626 states and 628 transitions. [2018-09-26 08:18:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:18:26,114 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 414 [2018-09-26 08:18:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:26,115 INFO L225 Difference]: With dead ends: 626 [2018-09-26 08:18:26,115 INFO L226 Difference]: Without dead ends: 417 [2018-09-26 08:18:26,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15657 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21837, Invalid=74573, Unknown=0, NotChecked=0, Total=96410 [2018-09-26 08:18:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-09-26 08:18:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-09-26 08:18:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-09-26 08:18:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-09-26 08:18:26,321 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 414 [2018-09-26 08:18:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:26,321 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-09-26 08:18:26,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:18:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-09-26 08:18:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-09-26 08:18:26,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:26,323 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 103, 102, 1, 1, 1, 1] [2018-09-26 08:18:26,323 INFO L423 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:26,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 955385415, now seen corresponding path program 204 times [2018-09-26 08:18:26,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21218 backedges. 10712 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:26,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:26,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:18:26,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:18:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:18:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:18:26,968 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 108 states. [2018-09-26 08:18:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:27,621 INFO L93 Difference]: Finished difference Result 425 states and 426 transitions. [2018-09-26 08:18:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:18:27,622 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 416 [2018-09-26 08:18:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:27,622 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:18:27,622 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 08:18:27,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10816 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16802, Invalid=27930, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:18:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 08:18:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2018-09-26 08:18:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-09-26 08:18:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-09-26 08:18:27,828 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 416 [2018-09-26 08:18:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:27,828 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-09-26 08:18:27,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:18:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-09-26 08:18:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-09-26 08:18:27,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:27,829 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 103, 103, 1, 1, 1, 1] [2018-09-26 08:18:27,829 INFO L423 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:27,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash -997684285, now seen corresponding path program 205 times [2018-09-26 08:18:27,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 10712 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:28,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:28,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:18:28,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:18:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:18:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11129, Invalid=32761, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:18:28,770 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 210 states. [2018-09-26 08:18:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:30,813 INFO L93 Difference]: Finished difference Result 632 states and 634 transitions. [2018-09-26 08:18:30,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:18:30,813 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 418 [2018-09-26 08:18:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:30,814 INFO L225 Difference]: With dead ends: 632 [2018-09-26 08:18:30,814 INFO L226 Difference]: Without dead ends: 421 [2018-09-26 08:18:30,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15965 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=22257, Invalid=76025, Unknown=0, NotChecked=0, Total=98282 [2018-09-26 08:18:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-09-26 08:18:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-09-26 08:18:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 08:18:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-09-26 08:18:31,026 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 418 [2018-09-26 08:18:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:31,026 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-09-26 08:18:31,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:18:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-09-26 08:18:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-09-26 08:18:31,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:31,028 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 104, 103, 1, 1, 1, 1] [2018-09-26 08:18:31,028 INFO L423 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:31,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2079432707, now seen corresponding path program 206 times [2018-09-26 08:18:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 21632 backedges. 10920 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:31,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:31,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:18:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:18:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:18:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5780, Invalid=5992, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:18:31,687 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 109 states. [2018-09-26 08:18:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:32,403 INFO L93 Difference]: Finished difference Result 429 states and 430 transitions. [2018-09-26 08:18:32,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:18:32,403 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 420 [2018-09-26 08:18:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:32,404 INFO L225 Difference]: With dead ends: 429 [2018-09-26 08:18:32,404 INFO L226 Difference]: Without dead ends: 427 [2018-09-26 08:18:32,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11025 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17121, Invalid=28461, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:18:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-26 08:18:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2018-09-26 08:18:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-09-26 08:18:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-09-26 08:18:32,617 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 420 [2018-09-26 08:18:32,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:32,617 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-09-26 08:18:32,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:18:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-09-26 08:18:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-09-26 08:18:32,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:32,619 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 104, 104, 1, 1, 1, 1] [2018-09-26 08:18:32,619 INFO L423 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:32,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1175105543, now seen corresponding path program 207 times [2018-09-26 08:18:32,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:33,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 10920 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:33,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:33,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:18:33,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:18:33,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:18:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11341, Invalid=33391, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:18:33,584 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 212 states. [2018-09-26 08:18:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:35,207 INFO L93 Difference]: Finished difference Result 638 states and 640 transitions. [2018-09-26 08:18:35,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:18:35,208 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 422 [2018-09-26 08:18:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:35,209 INFO L225 Difference]: With dead ends: 638 [2018-09-26 08:18:35,209 INFO L226 Difference]: Without dead ends: 425 [2018-09-26 08:18:35,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22681, Invalid=77491, Unknown=0, NotChecked=0, Total=100172 [2018-09-26 08:18:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-09-26 08:18:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-09-26 08:18:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-09-26 08:18:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-09-26 08:18:35,421 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 422 [2018-09-26 08:18:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:35,421 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-09-26 08:18:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:18:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-09-26 08:18:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-09-26 08:18:35,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:35,423 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 105, 104, 1, 1, 1, 1] [2018-09-26 08:18:35,423 INFO L423 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:35,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash -576555213, now seen corresponding path program 208 times [2018-09-26 08:18:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22050 backedges. 11130 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:36,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:36,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:18:36,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:18:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:18:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:18:36,028 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 110 states. [2018-09-26 08:18:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:36,744 INFO L93 Difference]: Finished difference Result 433 states and 434 transitions. [2018-09-26 08:18:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:18:36,744 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 424 [2018-09-26 08:18:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:36,745 INFO L225 Difference]: With dead ends: 433 [2018-09-26 08:18:36,745 INFO L226 Difference]: Without dead ends: 431 [2018-09-26 08:18:36,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17443, Invalid=28997, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:18:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-09-26 08:18:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2018-09-26 08:18:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-26 08:18:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-09-26 08:18:36,960 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 424 [2018-09-26 08:18:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:36,961 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-09-26 08:18:36,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:18:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-09-26 08:18:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-09-26 08:18:36,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:36,962 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 105, 105, 1, 1, 1, 1] [2018-09-26 08:18:36,962 INFO L423 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:36,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -18845265, now seen corresponding path program 209 times [2018-09-26 08:18:36,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 11130 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:38,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:38,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:18:38,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:18:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:18:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11555, Invalid=34027, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:18:38,032 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 214 states. [2018-09-26 08:18:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:40,836 INFO L93 Difference]: Finished difference Result 644 states and 646 transitions. [2018-09-26 08:18:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:18:40,836 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 426 [2018-09-26 08:18:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:40,837 INFO L225 Difference]: With dead ends: 644 [2018-09-26 08:18:40,837 INFO L226 Difference]: Without dead ends: 429 [2018-09-26 08:18:40,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16590 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=23109, Invalid=78971, Unknown=0, NotChecked=0, Total=102080 [2018-09-26 08:18:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-09-26 08:18:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-09-26 08:18:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-09-26 08:18:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-09-26 08:18:41,058 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 426 [2018-09-26 08:18:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:41,058 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-09-26 08:18:41,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:18:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-09-26 08:18:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-09-26 08:18:41,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:41,059 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 106, 105, 1, 1, 1, 1] [2018-09-26 08:18:41,060 INFO L423 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:41,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1395430423, now seen corresponding path program 210 times [2018-09-26 08:18:41,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22472 backedges. 11342 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:41,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:41,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:18:41,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:18:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:18:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5997, Invalid=6213, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:18:41,674 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 111 states. [2018-09-26 08:18:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:42,418 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-09-26 08:18:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:18:42,418 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 428 [2018-09-26 08:18:42,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:42,419 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:18:42,419 INFO L226 Difference]: Without dead ends: 435 [2018-09-26 08:18:42,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11449 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17768, Invalid=29538, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:18:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-26 08:18:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-09-26 08:18:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-09-26 08:18:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-09-26 08:18:42,695 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 428 [2018-09-26 08:18:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:42,695 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-09-26 08:18:42,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:18:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-09-26 08:18:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-09-26 08:18:42,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:42,696 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 106, 106, 1, 1, 1, 1] [2018-09-26 08:18:42,697 INFO L423 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:42,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash -978906907, now seen corresponding path program 211 times [2018-09-26 08:18:42,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 11342 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:43,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:43,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:18:43,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:18:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:18:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11771, Invalid=34669, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:18:43,736 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 216 states. [2018-09-26 08:18:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:45,498 INFO L93 Difference]: Finished difference Result 650 states and 652 transitions. [2018-09-26 08:18:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:18:45,498 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 430 [2018-09-26 08:18:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:45,499 INFO L225 Difference]: With dead ends: 650 [2018-09-26 08:18:45,499 INFO L226 Difference]: Without dead ends: 433 [2018-09-26 08:18:45,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23541, Invalid=80465, Unknown=0, NotChecked=0, Total=104006 [2018-09-26 08:18:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-09-26 08:18:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-09-26 08:18:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-09-26 08:18:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-09-26 08:18:45,721 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 430 [2018-09-26 08:18:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:45,722 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-09-26 08:18:45,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:18:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-09-26 08:18:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-09-26 08:18:45,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:45,723 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 107, 106, 1, 1, 1, 1] [2018-09-26 08:18:45,723 INFO L423 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:45,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -255959521, now seen corresponding path program 212 times [2018-09-26 08:18:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 22898 backedges. 11556 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:46,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:46,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:18:46,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:18:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:18:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6107, Invalid=6325, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:18:46,424 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 112 states. [2018-09-26 08:18:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:47,141 INFO L93 Difference]: Finished difference Result 441 states and 442 transitions. [2018-09-26 08:18:47,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-09-26 08:18:47,141 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 432 [2018-09-26 08:18:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:47,142 INFO L225 Difference]: With dead ends: 441 [2018-09-26 08:18:47,142 INFO L226 Difference]: Without dead ends: 439 [2018-09-26 08:18:47,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11664 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18096, Invalid=30084, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:18:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-09-26 08:18:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 435. [2018-09-26 08:18:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-09-26 08:18:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-09-26 08:18:47,366 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 432 [2018-09-26 08:18:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:47,367 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-09-26 08:18:47,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:18:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-09-26 08:18:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-09-26 08:18:47,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:47,368 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 1, 1, 1, 1] [2018-09-26 08:18:47,368 INFO L423 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1164030565, now seen corresponding path program 213 times [2018-09-26 08:18:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23112 backedges. 11556 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:48,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:48,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:18:48,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:18:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:18:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11989, Invalid=35317, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:18:48,390 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 218 states. [2018-09-26 08:18:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:50,704 INFO L93 Difference]: Finished difference Result 656 states and 658 transitions. [2018-09-26 08:18:50,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:18:50,704 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 434 [2018-09-26 08:18:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:50,705 INFO L225 Difference]: With dead ends: 656 [2018-09-26 08:18:50,705 INFO L226 Difference]: Without dead ends: 437 [2018-09-26 08:18:50,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17227 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23977, Invalid=81973, Unknown=0, NotChecked=0, Total=105950 [2018-09-26 08:18:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-09-26 08:18:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-09-26 08:18:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-09-26 08:18:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-09-26 08:18:50,928 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 434 [2018-09-26 08:18:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:50,928 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-09-26 08:18:50,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:18:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-09-26 08:18:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-09-26 08:18:50,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:50,930 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 108, 107, 1, 1, 1, 1] [2018-09-26 08:18:50,930 INFO L423 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:50,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1032294955, now seen corresponding path program 214 times [2018-09-26 08:18:50,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 23328 backedges. 11772 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:51,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:51,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:18:51,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:18:51,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:18:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6218, Invalid=6438, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:18:51,608 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 113 states. [2018-09-26 08:18:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:52,365 INFO L93 Difference]: Finished difference Result 445 states and 446 transitions. [2018-09-26 08:18:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-09-26 08:18:52,365 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 436 [2018-09-26 08:18:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:52,366 INFO L225 Difference]: With dead ends: 445 [2018-09-26 08:18:52,366 INFO L226 Difference]: Without dead ends: 443 [2018-09-26 08:18:52,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11881 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18427, Invalid=30635, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:18:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-09-26 08:18:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-09-26 08:18:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-09-26 08:18:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-09-26 08:18:52,592 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 436 [2018-09-26 08:18:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:52,592 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-09-26 08:18:52,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:18:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-09-26 08:18:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-09-26 08:18:52,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:52,593 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 108, 108, 1, 1, 1, 1] [2018-09-26 08:18:52,594 INFO L423 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:52,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash 101926865, now seen corresponding path program 215 times [2018-09-26 08:18:52,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11772 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:53,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:53,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-09-26 08:18:53,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:18:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:18:53,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12209, Invalid=35971, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:18:53,688 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 220 states. [2018-09-26 08:18:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:56,075 INFO L93 Difference]: Finished difference Result 662 states and 664 transitions. [2018-09-26 08:18:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:18:56,075 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 438 [2018-09-26 08:18:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:56,076 INFO L225 Difference]: With dead ends: 662 [2018-09-26 08:18:56,076 INFO L226 Difference]: Without dead ends: 441 [2018-09-26 08:18:56,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17550 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=24417, Invalid=83495, Unknown=0, NotChecked=0, Total=107912 [2018-09-26 08:18:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-09-26 08:18:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-09-26 08:18:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-09-26 08:18:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-09-26 08:18:56,307 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 438 [2018-09-26 08:18:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:56,307 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-09-26 08:18:56,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:18:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-09-26 08:18:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-09-26 08:18:56,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:56,309 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 109, 108, 1, 1, 1, 1] [2018-09-26 08:18:56,309 INFO L423 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:56,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1460583179, now seen corresponding path program 216 times [2018-09-26 08:18:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 23762 backedges. 11990 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:56,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:56,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:18:56,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:18:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:18:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:18:56,963 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 114 states. [2018-09-26 08:18:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:57,743 INFO L93 Difference]: Finished difference Result 449 states and 450 transitions. [2018-09-26 08:18:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-09-26 08:18:57,743 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 440 [2018-09-26 08:18:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:57,743 INFO L225 Difference]: With dead ends: 449 [2018-09-26 08:18:57,743 INFO L226 Difference]: Without dead ends: 447 [2018-09-26 08:18:57,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18761, Invalid=31191, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:18:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-26 08:18:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2018-09-26 08:18:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-09-26 08:18:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 444 transitions. [2018-09-26 08:18:57,969 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 444 transitions. Word has length 440 [2018-09-26 08:18:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:57,969 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 444 transitions. [2018-09-26 08:18:57,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:18:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 444 transitions. [2018-09-26 08:18:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-09-26 08:18:57,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:57,971 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 109, 109, 1, 1, 1, 1] [2018-09-26 08:18:57,971 INFO L423 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:57,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:57,971 INFO L82 PathProgramCache]: Analyzing trace with hash -833937529, now seen corresponding path program 217 times [2018-09-26 08:18:57,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11990 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:59,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:59,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-09-26 08:18:59,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-09-26 08:18:59,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-09-26 08:18:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12431, Invalid=36631, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:18:59,090 INFO L87 Difference]: Start difference. First operand 443 states and 444 transitions. Second operand 222 states. [2018-09-26 08:19:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:02,939 INFO L93 Difference]: Finished difference Result 668 states and 670 transitions. [2018-09-26 08:19:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-09-26 08:19:02,939 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 442 [2018-09-26 08:19:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:02,940 INFO L225 Difference]: With dead ends: 668 [2018-09-26 08:19:02,940 INFO L226 Difference]: Without dead ends: 445 [2018-09-26 08:19:02,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17876 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=24861, Invalid=85031, Unknown=0, NotChecked=0, Total=109892 [2018-09-26 08:19:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-09-26 08:19:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-09-26 08:19:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-26 08:19:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2018-09-26 08:19:03,245 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 442 [2018-09-26 08:19:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:03,245 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 446 transitions. [2018-09-26 08:19:03,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-09-26 08:19:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 446 transitions. [2018-09-26 08:19:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-09-26 08:19:03,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:03,247 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 110, 109, 1, 1, 1, 1] [2018-09-26 08:19:03,247 INFO L423 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:03,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:03,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2121898559, now seen corresponding path program 218 times [2018-09-26 08:19:03,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24200 backedges. 12210 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:03,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:03,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:19:03,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:19:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:19:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6443, Invalid=6667, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:19:03,933 INFO L87 Difference]: Start difference. First operand 445 states and 446 transitions. Second operand 115 states. [2018-09-26 08:19:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:04,681 INFO L93 Difference]: Finished difference Result 453 states and 454 transitions. [2018-09-26 08:19:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-09-26 08:19:04,681 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 444 [2018-09-26 08:19:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:04,682 INFO L225 Difference]: With dead ends: 453 [2018-09-26 08:19:04,682 INFO L226 Difference]: Without dead ends: 451 [2018-09-26 08:19:04,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19098, Invalid=31752, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:19:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-09-26 08:19:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2018-09-26 08:19:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-09-26 08:19:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-09-26 08:19:04,916 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 444 [2018-09-26 08:19:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:04,917 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-09-26 08:19:04,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:19:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-09-26 08:19:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-09-26 08:19:04,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:04,918 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 110, 110, 1, 1, 1, 1] [2018-09-26 08:19:04,918 INFO L423 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:04,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash 964883645, now seen corresponding path program 219 times [2018-09-26 08:19:04,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24420 backedges. 12210 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:06,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:06,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-09-26 08:19:06,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-09-26 08:19:06,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-09-26 08:19:06,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12655, Invalid=37297, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:19:06,052 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 224 states. [2018-09-26 08:19:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:08,446 INFO L93 Difference]: Finished difference Result 674 states and 676 transitions. [2018-09-26 08:19:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-09-26 08:19:08,446 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 446 [2018-09-26 08:19:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:08,447 INFO L225 Difference]: With dead ends: 674 [2018-09-26 08:19:08,447 INFO L226 Difference]: Without dead ends: 449 [2018-09-26 08:19:08,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18205 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=25309, Invalid=86581, Unknown=0, NotChecked=0, Total=111890 [2018-09-26 08:19:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-09-26 08:19:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-09-26 08:19:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-09-26 08:19:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-09-26 08:19:08,685 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 446 [2018-09-26 08:19:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:08,686 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-09-26 08:19:08,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-09-26 08:19:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-09-26 08:19:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-09-26 08:19:08,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:08,687 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 111, 110, 1, 1, 1, 1] [2018-09-26 08:19:08,687 INFO L423 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:08,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:08,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1260614153, now seen corresponding path program 220 times [2018-09-26 08:19:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24642 backedges. 12432 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:09,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:09,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:19:09,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:19:09,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:19:09,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:19:09,390 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 116 states. [2018-09-26 08:19:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:10,164 INFO L93 Difference]: Finished difference Result 457 states and 458 transitions. [2018-09-26 08:19:10,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-09-26 08:19:10,165 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 448 [2018-09-26 08:19:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:10,165 INFO L225 Difference]: With dead ends: 457 [2018-09-26 08:19:10,165 INFO L226 Difference]: Without dead ends: 455 [2018-09-26 08:19:10,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19438, Invalid=32318, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:19:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-09-26 08:19:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 451. [2018-09-26 08:19:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-09-26 08:19:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 452 transitions. [2018-09-26 08:19:10,405 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 452 transitions. Word has length 448 [2018-09-26 08:19:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:10,405 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 452 transitions. [2018-09-26 08:19:10,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:19:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 452 transitions. [2018-09-26 08:19:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-09-26 08:19:10,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:10,407 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 111, 111, 1, 1, 1, 1] [2018-09-26 08:19:10,407 INFO L423 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:10,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:10,407 INFO L82 PathProgramCache]: Analyzing trace with hash -269490317, now seen corresponding path program 221 times [2018-09-26 08:19:10,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 24864 backedges. 12432 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:11,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:11,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-09-26 08:19:11,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-09-26 08:19:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-09-26 08:19:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12881, Invalid=37969, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:19:11,535 INFO L87 Difference]: Start difference. First operand 451 states and 452 transitions. Second operand 226 states. [2018-09-26 08:19:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:15,484 INFO L93 Difference]: Finished difference Result 680 states and 682 transitions. [2018-09-26 08:19:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-09-26 08:19:15,484 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 450 [2018-09-26 08:19:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:15,485 INFO L225 Difference]: With dead ends: 680 [2018-09-26 08:19:15,485 INFO L226 Difference]: Without dead ends: 453 [2018-09-26 08:19:15,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18537 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25761, Invalid=88145, Unknown=0, NotChecked=0, Total=113906 [2018-09-26 08:19:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-09-26 08:19:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2018-09-26 08:19:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-09-26 08:19:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 454 transitions. [2018-09-26 08:19:15,757 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 454 transitions. Word has length 450 [2018-09-26 08:19:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:15,758 INFO L480 AbstractCegarLoop]: Abstraction has 453 states and 454 transitions. [2018-09-26 08:19:15,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-09-26 08:19:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 454 transitions. [2018-09-26 08:19:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-09-26 08:19:15,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:15,759 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 112, 111, 1, 1, 1, 1] [2018-09-26 08:19:15,759 INFO L423 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:15,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2046405715, now seen corresponding path program 222 times [2018-09-26 08:19:15,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25088 backedges. 12656 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:16,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:16,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:19:16,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:19:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:19:16,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6672, Invalid=6900, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:19:16,509 INFO L87 Difference]: Start difference. First operand 453 states and 454 transitions. Second operand 117 states. [2018-09-26 08:19:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:17,275 INFO L93 Difference]: Finished difference Result 461 states and 462 transitions. [2018-09-26 08:19:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-09-26 08:19:17,275 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 452 [2018-09-26 08:19:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:17,276 INFO L225 Difference]: With dead ends: 461 [2018-09-26 08:19:17,276 INFO L226 Difference]: Without dead ends: 459 [2018-09-26 08:19:17,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12769 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19781, Invalid=32889, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:19:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-26 08:19:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2018-09-26 08:19:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-09-26 08:19:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-09-26 08:19:17,519 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 452 [2018-09-26 08:19:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:17,520 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-09-26 08:19:17,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:19:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-09-26 08:19:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-09-26 08:19:17,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:17,522 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 112, 112, 1, 1, 1, 1] [2018-09-26 08:19:17,522 INFO L423 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:17,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 499062697, now seen corresponding path program 223 times [2018-09-26 08:19:17,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 12656 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:18,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:18,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-09-26 08:19:18,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-09-26 08:19:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-09-26 08:19:18,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13109, Invalid=38647, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:19:18,823 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 228 states. Received shutdown request... [2018-09-26 08:19:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:19:20,492 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:19:20,499 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:19:20,499 INFO L202 PluginConnector]: Adding new model down.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:20 BoogieIcfgContainer [2018-09-26 08:19:20,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:20,500 INFO L168 Benchmark]: Toolchain (without parser) took 250883.82 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 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 902.8 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:20,502 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:19:20,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.16 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:19:20,503 INFO L168 Benchmark]: Boogie Preprocessor took 23.55 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:19:20,503 INFO L168 Benchmark]: RCFGBuilder took 289.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:20,504 INFO L168 Benchmark]: TraceAbstraction took 250519.47 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 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 892.2 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:20,505 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.20 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 44.16 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.55 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 289.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250519.47 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 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 892.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while BasicCegarLoop was constructing difference of abstraction (455states) and FLOYD_HOARE automaton (currently 195 states, 228 states before enhancement), while ReachableStatesComputation was computing reachable states (544 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 250.4s OverallTime, 225 OverallIterations, 113 TraceHistogramMax, 147.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7340 SDtfs, 3420 SDslu, 34069 SDs, 0 SdLazy, 456506 SolverSat, 23832 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38834 GetRequests, 6441 SyntacticMatches, 0 SemanticMatches, 32393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201934 ImplicationChecksByTransitivity, 87.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=224, 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: 20.9s AutomataMinimizationTime, 224 MinimizatonAttempts, 448 StatesRemovedByMinimization, 112 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 13.7s SatisfiabilityAnalysisTime, 56.6s InterpolantComputationTime, 51750 NumberOfCodeBlocks, 51750 NumberOfCodeBlocksAsserted, 225 NumberOfCheckSat, 51525 ConstructedInterpolants, 0 QuantifiedInterpolants, 46864040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 225 InterpolantComputations, 2 PerfectInterpolantSequences, 961856/1911056 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/down.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-20-515.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/down.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-20-515.csv Completed graceful shutdown