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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 14:57:20,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 14:57:20,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 14:57:20,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 14:57:20,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 14:57:20,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 14:57:20,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 14:57:20,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 14:57:20,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 14:57:20,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 14:57:20,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 14:57:20,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 14:57:20,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 14:57:20,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 14:57:20,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 14:57:20,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 14:57:20,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 14:57:20,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 14:57:20,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 14:57:20,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 14:57:20,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 14:57:20,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 14:57:20,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 14:57:20,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 14:57:20,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 14:57:20,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 14:57:20,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 14:57:20,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 14:57:20,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 14:57:20,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 14:57:20,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 14:57:20,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 14:57:20,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 14:57:20,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 14:57:20,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 14:57:20,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 14:57:20,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 14:57:20,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 14:57:20,734 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 14:57:20,734 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 14:57:20,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 14:57:20,735 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 14:57:20,735 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 14:57:20,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 14:57:20,736 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 14:57:20,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 14:57:20,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 14:57:20,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 14:57:20,737 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 14:57:20,737 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 14:57:20,738 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 14:57:20,738 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 14:57:20,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 14:57:20,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 14:57:20,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 14:57:20,820 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 14:57:20,821 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 14:57:20,822 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-10-15 14:57:20,822 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-10-15 14:57:20,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 14:57:20,882 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 14:57:20,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 14:57:20,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 14:57:20,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 14:57:20,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... [2018-10-15 14:57:20,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 14:57:20,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 14:57:20,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 14:57:20,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 14:57:20,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 14:57:21,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 14:57:21,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 14:57:21,439 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 14:57:21,441 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:21 BoogieIcfgContainer [2018-10-15 14:57:21,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 14:57:21,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 14:57:21,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 14:57:21,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 14:57:21,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:20" (1/2) ... [2018-10-15 14:57:21,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b3ff1f and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:21, skipping insertion in model container [2018-10-15 14:57:21,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:21" (2/2) ... [2018-10-15 14:57:21,450 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-10-15 14:57:21,461 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 14:57:21,470 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 14:57:21,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 14:57:21,521 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 14:57:21,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 14:57:21,522 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 14:57:21,522 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 14:57:21,522 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 14:57:21,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 14:57:21,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 14:57:21,523 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 14:57:21,523 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 14:57:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-15 14:57:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 14:57:21,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:21,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:21,554 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:21,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1650982221, now seen corresponding path program 1 times [2018-10-15 14:57:21,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:21,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 14:57:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 14:57:21,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 14:57:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 14:57:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 14:57:21,799 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2018-10-15 14:57:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:22,000 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-10-15 14:57:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 14:57:22,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-15 14:57:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:22,015 INFO L225 Difference]: With dead ends: 44 [2018-10-15 14:57:22,015 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 14:57:22,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 14:57:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 14:57:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-10-15 14:57:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-15 14:57:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-10-15 14:57:22,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 16 [2018-10-15 14:57:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:22,057 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-10-15 14:57:22,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 14:57:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-10-15 14:57:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 14:57:22,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:22,058 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:22,059 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:22,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:22,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1205518505, now seen corresponding path program 1 times [2018-10-15 14:57:22,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 14:57:22,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 14:57:22,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 14:57:22,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 14:57:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 14:57:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 14:57:22,160 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 5 states. [2018-10-15 14:57:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:22,390 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-10-15 14:57:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 14:57:22,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-15 14:57:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:22,394 INFO L225 Difference]: With dead ends: 41 [2018-10-15 14:57:22,394 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 14:57:22,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 14:57:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-15 14:57:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 14:57:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 14:57:22,401 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-10-15 14:57:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:22,402 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 14:57:22,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 14:57:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 14:57:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 14:57:22,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:22,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:22,404 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:22,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:22,404 INFO L82 PathProgramCache]: Analyzing trace with hash -25587128, now seen corresponding path program 1 times [2018-10-15 14:57:22,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 14:57:22,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:22,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 14:57:22,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 14:57:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 14:57:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 14:57:22,605 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-10-15 14:57:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:22,741 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-15 14:57:22,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 14:57:22,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-10-15 14:57:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:22,743 INFO L225 Difference]: With dead ends: 45 [2018-10-15 14:57:22,743 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 14:57:22,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 14:57:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-10-15 14:57:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 14:57:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-15 14:57:22,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 29 [2018-10-15 14:57:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:22,751 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-15 14:57:22,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 14:57:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-15 14:57:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 14:57:22,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:22,752 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:22,753 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:22,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1483846674, now seen corresponding path program 2 times [2018-10-15 14:57:22,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 14:57:22,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:22,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 14:57:22,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 14:57:22,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 14:57:22,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:22,890 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 7 states. [2018-10-15 14:57:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:23,069 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-10-15 14:57:23,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 14:57:23,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-10-15 14:57:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:23,074 INFO L225 Difference]: With dead ends: 53 [2018-10-15 14:57:23,075 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 14:57:23,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 14:57:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2018-10-15 14:57:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 14:57:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-15 14:57:23,082 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-10-15 14:57:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:23,083 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-15 14:57:23,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 14:57:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-15 14:57:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 14:57:23,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:23,085 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:23,085 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:23,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 179858396, now seen corresponding path program 3 times [2018-10-15 14:57:23,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 14:57:23,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:23,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 14:57:23,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 14:57:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 14:57:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 14:57:23,279 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 9 states. [2018-10-15 14:57:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:23,909 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-10-15 14:57:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 14:57:23,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-15 14:57:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:23,914 INFO L225 Difference]: With dead ends: 61 [2018-10-15 14:57:23,915 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 14:57:23,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 14:57:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-10-15 14:57:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 14:57:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-15 14:57:23,922 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2018-10-15 14:57:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:23,922 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-15 14:57:23,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 14:57:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-15 14:57:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-15 14:57:23,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:23,924 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:23,925 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:23,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 5749158, now seen corresponding path program 4 times [2018-10-15 14:57:23,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-15 14:57:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:24,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 14:57:24,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 14:57:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 14:57:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 14:57:24,032 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 7 states. [2018-10-15 14:57:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:24,225 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-15 14:57:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 14:57:24,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-10-15 14:57:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:24,228 INFO L225 Difference]: With dead ends: 65 [2018-10-15 14:57:24,228 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 14:57:24,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 14:57:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-15 14:57:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 14:57:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-10-15 14:57:24,235 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-10-15 14:57:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:24,235 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-10-15 14:57:24,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 14:57:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-10-15 14:57:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 14:57:24,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:24,238 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:24,238 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:24,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:24,238 INFO L82 PathProgramCache]: Analyzing trace with hash 353480555, now seen corresponding path program 5 times [2018-10-15 14:57:24,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-15 14:57:24,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:24,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 14:57:24,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 14:57:24,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 14:57:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:24,425 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 11 states. [2018-10-15 14:57:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:25,111 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-10-15 14:57:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 14:57:25,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 14:57:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:25,114 INFO L225 Difference]: With dead ends: 72 [2018-10-15 14:57:25,114 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 14:57:25,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 14:57:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-10-15 14:57:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 14:57:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-15 14:57:25,121 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 58 [2018-10-15 14:57:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:25,122 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-15 14:57:25,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 14:57:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-15 14:57:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 14:57:25,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:25,123 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:25,124 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:25,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1752734177, now seen corresponding path program 6 times [2018-10-15 14:57:25,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-15 14:57:25,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 14:57:25,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 14:57:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 14:57:25,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 14:57:25,278 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 9 states. [2018-10-15 14:57:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:25,523 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-10-15 14:57:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 14:57:25,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-10-15 14:57:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:25,526 INFO L225 Difference]: With dead ends: 78 [2018-10-15 14:57:25,526 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 14:57:25,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 14:57:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-15 14:57:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-15 14:57:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-10-15 14:57:25,533 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 66 [2018-10-15 14:57:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:25,534 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-10-15 14:57:25,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 14:57:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-10-15 14:57:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-15 14:57:25,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:25,536 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:25,536 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:25,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1663745040, now seen corresponding path program 7 times [2018-10-15 14:57:25,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-15 14:57:25,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:25,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 14:57:25,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 14:57:25,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 14:57:25,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:25,755 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 11 states. [2018-10-15 14:57:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:26,091 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-10-15 14:57:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 14:57:26,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-10-15 14:57:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:26,094 INFO L225 Difference]: With dead ends: 83 [2018-10-15 14:57:26,094 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 14:57:26,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 14:57:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-10-15 14:57:26,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 14:57:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-10-15 14:57:26,101 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 71 [2018-10-15 14:57:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:26,102 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-10-15 14:57:26,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 14:57:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-10-15 14:57:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 14:57:26,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:26,104 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:26,104 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:26,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1666080959, now seen corresponding path program 8 times [2018-10-15 14:57:26,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-15 14:57:26,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:26,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 14:57:26,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 14:57:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 14:57:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 14:57:26,399 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 13 states. [2018-10-15 14:57:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:26,618 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-10-15 14:57:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 14:57:26,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-10-15 14:57:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:26,620 INFO L225 Difference]: With dead ends: 90 [2018-10-15 14:57:26,620 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 14:57:26,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 14:57:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2018-10-15 14:57:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 14:57:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-10-15 14:57:26,629 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2018-10-15 14:57:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:26,629 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-15 14:57:26,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 14:57:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-10-15 14:57:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 14:57:26,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:26,631 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:26,632 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:26,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:26,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1401219017, now seen corresponding path program 9 times [2018-10-15 14:57:26,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-15 14:57:26,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:26,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 14:57:26,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 14:57:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 14:57:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 14:57:26,786 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 13 states. [2018-10-15 14:57:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:27,054 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-10-15 14:57:27,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 14:57:27,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 84 [2018-10-15 14:57:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:27,056 INFO L225 Difference]: With dead ends: 96 [2018-10-15 14:57:27,056 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 14:57:27,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 14:57:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-10-15 14:57:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 14:57:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-10-15 14:57:27,063 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2018-10-15 14:57:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:27,063 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-10-15 14:57:27,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 14:57:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-10-15 14:57:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 14:57:27,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:27,066 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:27,067 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:27,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash -439893126, now seen corresponding path program 10 times [2018-10-15 14:57:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-15 14:57:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:27,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 14:57:27,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 14:57:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 14:57:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:27,325 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 15 states. [2018-10-15 14:57:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:27,757 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-10-15 14:57:27,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 14:57:27,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 14:57:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:27,759 INFO L225 Difference]: With dead ends: 101 [2018-10-15 14:57:27,760 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 14:57:27,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 14:57:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-15 14:57:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 14:57:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-10-15 14:57:27,766 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 89 [2018-10-15 14:57:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:27,767 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-10-15 14:57:27,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 14:57:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-10-15 14:57:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 14:57:27,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:27,769 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:27,769 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:27,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash -620582377, now seen corresponding path program 11 times [2018-10-15 14:57:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-15 14:57:28,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:28,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 14:57:28,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 14:57:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 14:57:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 14:57:28,181 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 17 states. [2018-10-15 14:57:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:28,635 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-10-15 14:57:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 14:57:28,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2018-10-15 14:57:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:28,637 INFO L225 Difference]: With dead ends: 106 [2018-10-15 14:57:28,637 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 14:57:28,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 14:57:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-15 14:57:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 14:57:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-10-15 14:57:28,643 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 94 [2018-10-15 14:57:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:28,643 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-10-15 14:57:28,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 14:57:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-10-15 14:57:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 14:57:28,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:28,645 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:28,646 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:28,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1601151590, now seen corresponding path program 12 times [2018-10-15 14:57:28,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-10-15 14:57:28,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 14:57:28,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 14:57:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 14:57:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:28,800 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 15 states. [2018-10-15 14:57:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:29,124 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-10-15 14:57:29,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 14:57:29,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-10-15 14:57:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:29,126 INFO L225 Difference]: With dead ends: 113 [2018-10-15 14:57:29,126 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 14:57:29,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 14:57:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2018-10-15 14:57:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 14:57:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-10-15 14:57:29,131 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 99 [2018-10-15 14:57:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:29,131 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-10-15 14:57:29,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 14:57:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-10-15 14:57:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 14:57:29,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:29,133 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:29,133 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:29,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1021366300, now seen corresponding path program 13 times [2018-10-15 14:57:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-10-15 14:57:29,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:29,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 14:57:29,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 14:57:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 14:57:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:29,533 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 19 states. [2018-10-15 14:57:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:29,910 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-10-15 14:57:29,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 14:57:29,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 107 [2018-10-15 14:57:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:29,912 INFO L225 Difference]: With dead ends: 119 [2018-10-15 14:57:29,912 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 14:57:29,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 14:57:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-15 14:57:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 14:57:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-10-15 14:57:29,917 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 107 [2018-10-15 14:57:29,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:29,918 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-10-15 14:57:29,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 14:57:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-10-15 14:57:29,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 14:57:29,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:29,919 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:29,920 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:29,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1135579155, now seen corresponding path program 14 times [2018-10-15 14:57:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-15 14:57:30,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 14:57:30,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 14:57:30,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 14:57:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 14:57:30,912 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 17 states. [2018-10-15 14:57:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:31,316 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-10-15 14:57:31,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 14:57:31,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2018-10-15 14:57:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:31,318 INFO L225 Difference]: With dead ends: 126 [2018-10-15 14:57:31,318 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 14:57:31,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 14:57:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2018-10-15 14:57:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 14:57:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-15 14:57:31,321 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 112 [2018-10-15 14:57:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:31,321 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-15 14:57:31,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 14:57:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-15 14:57:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 14:57:31,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:31,322 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:31,323 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:31,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash -368892445, now seen corresponding path program 15 times [2018-10-15 14:57:31,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-15 14:57:31,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:31,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 14:57:31,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 14:57:31,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 14:57:31,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 14:57:31,532 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 21 states. [2018-10-15 14:57:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:31,927 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-10-15 14:57:31,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 14:57:31,928 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 120 [2018-10-15 14:57:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:31,929 INFO L225 Difference]: With dead ends: 132 [2018-10-15 14:57:31,930 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 14:57:31,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 14:57:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-15 14:57:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 14:57:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-10-15 14:57:31,934 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 120 [2018-10-15 14:57:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:31,935 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-10-15 14:57:31,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 14:57:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-10-15 14:57:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 14:57:31,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:31,936 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:31,936 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:31,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash 834756942, now seen corresponding path program 16 times [2018-10-15 14:57:31,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-15 14:57:32,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:32,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 14:57:32,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 14:57:32,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 14:57:32,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:32,191 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 23 states. [2018-10-15 14:57:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:32,656 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-10-15 14:57:32,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 14:57:32,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 125 [2018-10-15 14:57:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:32,658 INFO L225 Difference]: With dead ends: 137 [2018-10-15 14:57:32,659 INFO L226 Difference]: Without dead ends: 133 [2018-10-15 14:57:32,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-15 14:57:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-15 14:57:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 14:57:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-15 14:57:32,664 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 125 [2018-10-15 14:57:32,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:32,664 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-15 14:57:32,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 14:57:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-15 14:57:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 14:57:32,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:32,666 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:32,666 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:32,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:32,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1967558851, now seen corresponding path program 17 times [2018-10-15 14:57:32,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-10-15 14:57:33,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:33,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 14:57:33,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 14:57:33,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 14:57:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 14:57:33,337 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 25 states. [2018-10-15 14:57:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:33,939 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-10-15 14:57:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 14:57:33,940 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 130 [2018-10-15 14:57:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:33,941 INFO L225 Difference]: With dead ends: 142 [2018-10-15 14:57:33,942 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 14:57:33,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:57:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 14:57:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-15 14:57:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 14:57:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-10-15 14:57:33,945 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 130 [2018-10-15 14:57:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:33,946 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-10-15 14:57:33,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 14:57:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-10-15 14:57:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 14:57:33,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:33,947 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:33,947 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:33,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1739734418, now seen corresponding path program 18 times [2018-10-15 14:57:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-10-15 14:57:34,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:34,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 14:57:34,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 14:57:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 14:57:34,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:34,223 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 19 states. [2018-10-15 14:57:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:34,623 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-10-15 14:57:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 14:57:34,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 135 [2018-10-15 14:57:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:34,625 INFO L225 Difference]: With dead ends: 149 [2018-10-15 14:57:34,625 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 14:57:34,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 14:57:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-10-15 14:57:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-15 14:57:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-10-15 14:57:34,630 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 135 [2018-10-15 14:57:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:34,630 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-10-15 14:57:34,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 14:57:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-10-15 14:57:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-15 14:57:34,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:34,631 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:34,631 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:34,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1709094840, now seen corresponding path program 19 times [2018-10-15 14:57:34,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-10-15 14:57:35,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:35,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 14:57:35,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 14:57:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 14:57:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:35,265 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 27 states. [2018-10-15 14:57:36,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:36,005 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-10-15 14:57:36,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 14:57:36,005 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 143 [2018-10-15 14:57:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:36,006 INFO L225 Difference]: With dead ends: 155 [2018-10-15 14:57:36,006 INFO L226 Difference]: Without dead ends: 151 [2018-10-15 14:57:36,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:57:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-15 14:57:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-10-15 14:57:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 14:57:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-10-15 14:57:36,011 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 143 [2018-10-15 14:57:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:36,011 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-10-15 14:57:36,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 14:57:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-10-15 14:57:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 14:57:36,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:36,012 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:36,013 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:36,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1057968999, now seen corresponding path program 20 times [2018-10-15 14:57:36,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-10-15 14:57:36,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:36,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 14:57:36,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 14:57:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 14:57:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 14:57:36,569 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 21 states. [2018-10-15 14:57:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:36,886 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-10-15 14:57:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 14:57:36,894 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 148 [2018-10-15 14:57:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:36,895 INFO L225 Difference]: With dead ends: 162 [2018-10-15 14:57:36,895 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 14:57:36,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 14:57:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2018-10-15 14:57:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 14:57:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-10-15 14:57:36,899 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 148 [2018-10-15 14:57:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:36,900 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-10-15 14:57:36,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 14:57:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-10-15 14:57:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 14:57:36,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:36,901 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:36,901 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:36,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash 158474127, now seen corresponding path program 21 times [2018-10-15 14:57:36,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 14:57:37,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:37,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 14:57:37,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 14:57:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 14:57:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 14:57:37,773 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 29 states. [2018-10-15 14:57:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:38,881 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-10-15 14:57:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 14:57:38,882 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 156 [2018-10-15 14:57:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:38,883 INFO L225 Difference]: With dead ends: 168 [2018-10-15 14:57:38,883 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 14:57:38,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:57:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 14:57:38,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-15 14:57:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-15 14:57:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-10-15 14:57:38,889 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 156 [2018-10-15 14:57:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:38,889 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-10-15 14:57:38,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 14:57:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-10-15 14:57:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-15 14:57:38,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:38,890 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:38,891 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:38,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:38,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1824025822, now seen corresponding path program 22 times [2018-10-15 14:57:38,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 14:57:39,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:39,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 14:57:39,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 14:57:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 14:57:39,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:39,298 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 31 states. [2018-10-15 14:57:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:40,061 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-10-15 14:57:40,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 14:57:40,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 161 [2018-10-15 14:57:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:40,063 INFO L225 Difference]: With dead ends: 173 [2018-10-15 14:57:40,063 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 14:57:40,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:57:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 14:57:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-15 14:57:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 14:57:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-10-15 14:57:40,068 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 161 [2018-10-15 14:57:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:40,069 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-10-15 14:57:40,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 14:57:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-10-15 14:57:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 14:57:40,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:40,070 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:40,070 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:40,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 515531631, now seen corresponding path program 23 times [2018-10-15 14:57:40,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 14:57:41,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:41,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 14:57:41,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 14:57:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 14:57:41,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 14:57:41,136 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 33 states. [2018-10-15 14:57:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:41,879 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2018-10-15 14:57:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 14:57:41,880 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 166 [2018-10-15 14:57:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:41,881 INFO L225 Difference]: With dead ends: 178 [2018-10-15 14:57:41,882 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 14:57:41,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:57:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 14:57:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-10-15 14:57:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-15 14:57:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-10-15 14:57:41,887 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 166 [2018-10-15 14:57:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:41,888 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-10-15 14:57:41,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 14:57:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-10-15 14:57:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-15 14:57:41,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:41,889 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:41,889 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:41,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1575926594, now seen corresponding path program 24 times [2018-10-15 14:57:41,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-10-15 14:57:42,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:42,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 14:57:42,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 14:57:42,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 14:57:42,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:42,153 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 23 states. [2018-10-15 14:57:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:42,561 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-10-15 14:57:42,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 14:57:42,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 171 [2018-10-15 14:57:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:42,563 INFO L225 Difference]: With dead ends: 185 [2018-10-15 14:57:42,563 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 14:57:42,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 14:57:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2018-10-15 14:57:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 14:57:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-15 14:57:42,568 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 171 [2018-10-15 14:57:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:42,569 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-15 14:57:42,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 14:57:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-15 14:57:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 14:57:42,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:42,570 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:42,570 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:42,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash -278113396, now seen corresponding path program 25 times [2018-10-15 14:57:42,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-10-15 14:57:42,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:42,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 14:57:42,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 14:57:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 14:57:42,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 14:57:42,957 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 25 states. [2018-10-15 14:57:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:43,586 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-10-15 14:57:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 14:57:43,587 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2018-10-15 14:57:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:43,588 INFO L225 Difference]: With dead ends: 193 [2018-10-15 14:57:43,588 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 14:57:43,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:57:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 14:57:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2018-10-15 14:57:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 14:57:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-10-15 14:57:43,592 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 179 [2018-10-15 14:57:43,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:43,592 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-10-15 14:57:43,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 14:57:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-10-15 14:57:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 14:57:43,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:43,593 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:43,594 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:43,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash 832176598, now seen corresponding path program 26 times [2018-10-15 14:57:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-10-15 14:57:44,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 14:57:44,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 14:57:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 14:57:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:44,295 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 27 states. [2018-10-15 14:57:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:44,876 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-10-15 14:57:44,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 14:57:44,876 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-10-15 14:57:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:44,878 INFO L225 Difference]: With dead ends: 201 [2018-10-15 14:57:44,878 INFO L226 Difference]: Without dead ends: 201 [2018-10-15 14:57:44,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:57:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-15 14:57:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2018-10-15 14:57:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 14:57:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-10-15 14:57:44,883 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 187 [2018-10-15 14:57:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:44,883 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-10-15 14:57:44,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 14:57:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-10-15 14:57:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 14:57:44,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:44,885 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:44,885 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:44,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:44,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1442956832, now seen corresponding path program 27 times [2018-10-15 14:57:44,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-10-15 14:57:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 14:57:45,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 14:57:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 14:57:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 14:57:45,286 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 29 states. [2018-10-15 14:57:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:45,975 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-10-15 14:57:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 14:57:45,975 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 195 [2018-10-15 14:57:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:45,976 INFO L225 Difference]: With dead ends: 209 [2018-10-15 14:57:45,976 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 14:57:45,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:57:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 14:57:45,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2018-10-15 14:57:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 14:57:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-10-15 14:57:45,983 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 195 [2018-10-15 14:57:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:45,984 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-10-15 14:57:45,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 14:57:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-10-15 14:57:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-15 14:57:45,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:45,985 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:45,985 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:45,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:45,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1680711786, now seen corresponding path program 28 times [2018-10-15 14:57:45,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-10-15 14:57:46,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:46,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 14:57:46,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 14:57:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 14:57:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:46,758 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 35 states. [2018-10-15 14:57:47,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:47,592 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-15 14:57:47,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 14:57:47,594 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 203 [2018-10-15 14:57:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:47,595 INFO L225 Difference]: With dead ends: 215 [2018-10-15 14:57:47,596 INFO L226 Difference]: Without dead ends: 211 [2018-10-15 14:57:47,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:57:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-15 14:57:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-15 14:57:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 14:57:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-10-15 14:57:47,600 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 203 [2018-10-15 14:57:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:47,600 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-10-15 14:57:47,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 14:57:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-10-15 14:57:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 14:57:47,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:47,602 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:47,602 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:47,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1754176729, now seen corresponding path program 29 times [2018-10-15 14:57:47,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-10-15 14:57:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 14:57:48,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 14:57:48,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 14:57:48,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:48,342 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 31 states. [2018-10-15 14:57:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:49,118 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-10-15 14:57:49,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 14:57:49,119 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 208 [2018-10-15 14:57:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:49,120 INFO L225 Difference]: With dead ends: 222 [2018-10-15 14:57:49,120 INFO L226 Difference]: Without dead ends: 222 [2018-10-15 14:57:49,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:57:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-15 14:57:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2018-10-15 14:57:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 14:57:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-15 14:57:49,126 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 208 [2018-10-15 14:57:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:49,126 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-15 14:57:49,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 14:57:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-15 14:57:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 14:57:49,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:49,128 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:49,128 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:49,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1324618013, now seen corresponding path program 30 times [2018-10-15 14:57:49,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1502 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-10-15 14:57:50,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:50,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 14:57:50,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 14:57:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 14:57:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 14:57:50,144 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 33 states. [2018-10-15 14:57:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:50,857 INFO L93 Difference]: Finished difference Result 230 states and 231 transitions. [2018-10-15 14:57:50,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 14:57:50,858 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 216 [2018-10-15 14:57:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:50,859 INFO L225 Difference]: With dead ends: 230 [2018-10-15 14:57:50,859 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 14:57:50,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:57:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 14:57:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2018-10-15 14:57:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 14:57:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-10-15 14:57:50,864 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 216 [2018-10-15 14:57:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:50,865 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-10-15 14:57:50,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 14:57:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-10-15 14:57:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-15 14:57:50,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:50,866 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:50,867 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:50,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 490498323, now seen corresponding path program 31 times [2018-10-15 14:57:50,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-15 14:57:51,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:51,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 14:57:51,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 14:57:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 14:57:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 14:57:51,667 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 37 states. [2018-10-15 14:57:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:54,243 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2018-10-15 14:57:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 14:57:54,243 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 224 [2018-10-15 14:57:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:54,245 INFO L225 Difference]: With dead ends: 236 [2018-10-15 14:57:54,245 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 14:57:54,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:57:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 14:57:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-15 14:57:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 14:57:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-10-15 14:57:54,251 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 224 [2018-10-15 14:57:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:54,252 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-10-15 14:57:54,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 14:57:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-10-15 14:57:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 14:57:54,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:54,253 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:54,253 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:54,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:54,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1060987874, now seen corresponding path program 32 times [2018-10-15 14:57:54,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1706 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-10-15 14:57:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 14:57:55,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 14:57:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 14:57:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:55,693 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 35 states. [2018-10-15 14:57:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:56,896 INFO L93 Difference]: Finished difference Result 243 states and 244 transitions. [2018-10-15 14:57:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 14:57:56,896 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 229 [2018-10-15 14:57:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:56,898 INFO L225 Difference]: With dead ends: 243 [2018-10-15 14:57:56,898 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 14:57:56,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:57:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 14:57:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2018-10-15 14:57:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-15 14:57:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-10-15 14:57:56,904 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 229 [2018-10-15 14:57:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:56,904 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-10-15 14:57:56,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 14:57:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-10-15 14:57:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-15 14:57:56,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:56,906 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:56,906 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:56,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash -769694744, now seen corresponding path program 33 times [2018-10-15 14:57:56,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-15 14:57:58,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:58,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 14:57:58,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 14:57:58,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 14:57:58,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:58,754 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 39 states. [2018-10-15 14:57:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:59,916 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-10-15 14:57:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 14:57:59,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 237 [2018-10-15 14:57:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:59,919 INFO L225 Difference]: With dead ends: 249 [2018-10-15 14:57:59,920 INFO L226 Difference]: Without dead ends: 245 [2018-10-15 14:57:59,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:57:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-15 14:57:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-15 14:57:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 14:57:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-15 14:57:59,924 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 237 [2018-10-15 14:57:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:59,925 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-15 14:57:59,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 14:57:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-15 14:57:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 14:57:59,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:59,926 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:59,926 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:59,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash -802939287, now seen corresponding path program 34 times [2018-10-15 14:57:59,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2018-10-15 14:58:01,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:01,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 14:58:01,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 14:58:01,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 14:58:01,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 14:58:01,214 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 41 states. [2018-10-15 14:58:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:02,441 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-15 14:58:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 14:58:02,449 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 242 [2018-10-15 14:58:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:02,450 INFO L225 Difference]: With dead ends: 254 [2018-10-15 14:58:02,450 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 14:58:02,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:58:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 14:58:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-15 14:58:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 14:58:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 249 transitions. [2018-10-15 14:58:02,454 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 249 transitions. Word has length 242 [2018-10-15 14:58:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:02,455 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 249 transitions. [2018-10-15 14:58:02,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 14:58:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 249 transitions. [2018-10-15 14:58:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 14:58:02,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:02,456 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:02,456 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:02,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 908381320, now seen corresponding path program 35 times [2018-10-15 14:58:02,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-10-15 14:58:03,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:03,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 14:58:03,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 14:58:03,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 14:58:03,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 14:58:03,357 INFO L87 Difference]: Start difference. First operand 248 states and 249 transitions. Second operand 37 states. [2018-10-15 14:58:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:04,121 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-10-15 14:58:04,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 14:58:04,122 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 247 [2018-10-15 14:58:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:04,123 INFO L225 Difference]: With dead ends: 261 [2018-10-15 14:58:04,123 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 14:58:04,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:58:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 14:58:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 256. [2018-10-15 14:58:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-15 14:58:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-10-15 14:58:04,127 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 247 [2018-10-15 14:58:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:04,128 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-10-15 14:58:04,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 14:58:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-10-15 14:58:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 14:58:04,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:04,129 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:04,129 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:04,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -487655982, now seen corresponding path program 36 times [2018-10-15 14:58:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2153 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-10-15 14:58:05,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:05,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 14:58:05,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 14:58:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 14:58:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:58:05,186 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 43 states. [2018-10-15 14:58:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:06,364 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-10-15 14:58:06,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 14:58:06,365 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 255 [2018-10-15 14:58:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:06,367 INFO L225 Difference]: With dead ends: 267 [2018-10-15 14:58:06,367 INFO L226 Difference]: Without dead ends: 263 [2018-10-15 14:58:06,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:58:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-15 14:58:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-15 14:58:06,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 14:58:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-10-15 14:58:06,372 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 255 [2018-10-15 14:58:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:06,372 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-10-15 14:58:06,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 14:58:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-10-15 14:58:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 14:58:06,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:06,374 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:06,374 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:06,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -424333633, now seen corresponding path program 37 times [2018-10-15 14:58:06,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-15 14:58:07,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:07,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 14:58:07,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 14:58:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 14:58:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:58:07,125 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 39 states. [2018-10-15 14:58:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:08,212 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2018-10-15 14:58:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 14:58:08,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 260 [2018-10-15 14:58:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:08,214 INFO L225 Difference]: With dead ends: 274 [2018-10-15 14:58:08,215 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 14:58:08,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:58:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 14:58:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2018-10-15 14:58:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 14:58:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-10-15 14:58:08,220 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 260 [2018-10-15 14:58:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:08,220 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-10-15 14:58:08,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 14:58:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-10-15 14:58:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 14:58:08,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:08,222 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:08,222 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:08,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1584271947, now seen corresponding path program 38 times [2018-10-15 14:58:08,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-15 14:58:08,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:08,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 14:58:08,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 14:58:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 14:58:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 14:58:08,919 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 41 states. [2018-10-15 14:58:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:09,869 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-10-15 14:58:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 14:58:09,870 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 268 [2018-10-15 14:58:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:09,872 INFO L225 Difference]: With dead ends: 282 [2018-10-15 14:58:09,872 INFO L226 Difference]: Without dead ends: 282 [2018-10-15 14:58:09,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:58:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-15 14:58:09,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 277. [2018-10-15 14:58:09,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 14:58:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-10-15 14:58:09,880 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 268 [2018-10-15 14:58:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:09,880 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-10-15 14:58:09,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 14:58:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-10-15 14:58:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 14:58:09,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:09,882 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:09,882 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:09,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 76764843, now seen corresponding path program 39 times [2018-10-15 14:58:09,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-15 14:58:10,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:10,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 14:58:10,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 14:58:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 14:58:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:58:10,576 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 43 states. [2018-10-15 14:58:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:11,870 INFO L93 Difference]: Finished difference Result 290 states and 291 transitions. [2018-10-15 14:58:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 14:58:11,870 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 276 [2018-10-15 14:58:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:11,871 INFO L225 Difference]: With dead ends: 290 [2018-10-15 14:58:11,871 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 14:58:11,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:58:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 14:58:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 285. [2018-10-15 14:58:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-15 14:58:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-10-15 14:58:11,874 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 276 [2018-10-15 14:58:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:11,875 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-10-15 14:58:11,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 14:58:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-10-15 14:58:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-15 14:58:11,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:11,876 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:11,876 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:11,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash 493840801, now seen corresponding path program 40 times [2018-10-15 14:58:11,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2712 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-15 14:58:12,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:12,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 14:58:12,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 14:58:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 14:58:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 14:58:12,593 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 45 states. [2018-10-15 14:58:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:14,120 INFO L93 Difference]: Finished difference Result 298 states and 299 transitions. [2018-10-15 14:58:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 14:58:14,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 284 [2018-10-15 14:58:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:14,123 INFO L225 Difference]: With dead ends: 298 [2018-10-15 14:58:14,123 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 14:58:14,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 14:58:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 14:58:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 293. [2018-10-15 14:58:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 14:58:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-10-15 14:58:14,128 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 284 [2018-10-15 14:58:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:14,128 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-10-15 14:58:14,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 14:58:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-10-15 14:58:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 14:58:14,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:14,130 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:14,130 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:14,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash -472111465, now seen corresponding path program 41 times [2018-10-15 14:58:14,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-15 14:58:14,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:14,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 14:58:14,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 14:58:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 14:58:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 14:58:14,914 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 45 states. [2018-10-15 14:58:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:16,164 INFO L93 Difference]: Finished difference Result 304 states and 305 transitions. [2018-10-15 14:58:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 14:58:16,165 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 292 [2018-10-15 14:58:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:16,167 INFO L225 Difference]: With dead ends: 304 [2018-10-15 14:58:16,167 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 14:58:16,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 14:58:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 14:58:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-10-15 14:58:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-15 14:58:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-10-15 14:58:16,174 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 292 [2018-10-15 14:58:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:16,174 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-10-15 14:58:16,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 14:58:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-10-15 14:58:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-15 14:58:16,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:16,176 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:16,177 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:16,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1431260902, now seen corresponding path program 42 times [2018-10-15 14:58:16,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2984 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-15 14:58:17,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:17,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 14:58:17,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 14:58:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 14:58:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:58:17,082 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 47 states. [2018-10-15 14:58:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:18,392 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-10-15 14:58:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 14:58:18,393 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 297 [2018-10-15 14:58:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:18,395 INFO L225 Difference]: With dead ends: 309 [2018-10-15 14:58:18,395 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 14:58:18,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2432, Invalid=5758, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 14:58:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 14:58:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-15 14:58:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 14:58:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-10-15 14:58:18,399 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 297 [2018-10-15 14:58:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:18,399 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-10-15 14:58:18,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 14:58:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-10-15 14:58:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 14:58:18,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:18,401 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:18,402 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:18,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1689075831, now seen corresponding path program 43 times [2018-10-15 14:58:18,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-15 14:58:19,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:19,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 14:58:19,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 14:58:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 14:58:19,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 14:58:19,231 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 49 states. [2018-10-15 14:58:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:20,552 INFO L93 Difference]: Finished difference Result 314 states and 315 transitions. [2018-10-15 14:58:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 14:58:20,553 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 302 [2018-10-15 14:58:20,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:20,555 INFO L225 Difference]: With dead ends: 314 [2018-10-15 14:58:20,555 INFO L226 Difference]: Without dead ends: 310 [2018-10-15 14:58:20,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2657, Invalid=6273, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:58:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-15 14:58:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-15 14:58:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 14:58:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 309 transitions. [2018-10-15 14:58:20,560 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 309 transitions. Word has length 302 [2018-10-15 14:58:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:20,560 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 309 transitions. [2018-10-15 14:58:20,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 14:58:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 309 transitions. [2018-10-15 14:58:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 14:58:20,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:20,562 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:20,563 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:20,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 736412474, now seen corresponding path program 44 times [2018-10-15 14:58:20,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3203 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-10-15 14:58:21,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:21,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 14:58:21,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 14:58:21,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 14:58:21,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:58:21,524 INFO L87 Difference]: Start difference. First operand 308 states and 309 transitions. Second operand 51 states. [2018-10-15 14:58:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:23,143 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-10-15 14:58:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 14:58:23,143 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 307 [2018-10-15 14:58:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:23,145 INFO L225 Difference]: With dead ends: 319 [2018-10-15 14:58:23,145 INFO L226 Difference]: Without dead ends: 315 [2018-10-15 14:58:23,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2892, Invalid=6810, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 14:58:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-15 14:58:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-10-15 14:58:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 14:58:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-10-15 14:58:23,149 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 307 [2018-10-15 14:58:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:23,150 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-10-15 14:58:23,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 14:58:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-10-15 14:58:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 14:58:23,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:23,152 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:23,152 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:23,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1909424727, now seen corresponding path program 45 times [2018-10-15 14:58:23,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3320 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-10-15 14:58:23,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:23,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 14:58:23,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 14:58:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 14:58:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:58:23,928 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 47 states. [2018-10-15 14:58:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:25,174 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-15 14:58:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 14:58:25,175 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 312 [2018-10-15 14:58:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:25,177 INFO L225 Difference]: With dead ends: 326 [2018-10-15 14:58:25,177 INFO L226 Difference]: Without dead ends: 326 [2018-10-15 14:58:25,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 14:58:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-15 14:58:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2018-10-15 14:58:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-15 14:58:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-10-15 14:58:25,181 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 312 [2018-10-15 14:58:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:25,181 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-10-15 14:58:25,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 14:58:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-10-15 14:58:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-15 14:58:25,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:25,183 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:25,183 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:25,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash -53489075, now seen corresponding path program 46 times [2018-10-15 14:58:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3498 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2018-10-15 14:58:26,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:26,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 14:58:26,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 14:58:26,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 14:58:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2077, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 14:58:26,195 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 53 states. [2018-10-15 14:58:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:28,044 INFO L93 Difference]: Finished difference Result 332 states and 333 transitions. [2018-10-15 14:58:28,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 14:58:28,045 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 320 [2018-10-15 14:58:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:28,047 INFO L225 Difference]: With dead ends: 332 [2018-10-15 14:58:28,047 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 14:58:28,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3137, Invalid=7369, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 14:58:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 14:58:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-15 14:58:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 14:58:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 327 transitions. [2018-10-15 14:58:28,052 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 327 transitions. Word has length 320 [2018-10-15 14:58:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:28,052 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 327 transitions. [2018-10-15 14:58:28,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 14:58:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 327 transitions. [2018-10-15 14:58:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 14:58:28,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:28,053 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:28,054 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:28,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash 887220004, now seen corresponding path program 47 times [2018-10-15 14:58:28,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3620 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-10-15 14:58:29,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:29,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 14:58:29,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 14:58:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 14:58:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 14:58:29,342 INFO L87 Difference]: Start difference. First operand 326 states and 327 transitions. Second operand 49 states. [2018-10-15 14:58:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:30,656 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-10-15 14:58:30,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 14:58:30,656 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 325 [2018-10-15 14:58:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:30,658 INFO L225 Difference]: With dead ends: 339 [2018-10-15 14:58:30,658 INFO L226 Difference]: Without dead ends: 339 [2018-10-15 14:58:30,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:58:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-15 14:58:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 334. [2018-10-15 14:58:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-15 14:58:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-10-15 14:58:30,664 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 325 [2018-10-15 14:58:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:30,664 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-10-15 14:58:30,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 14:58:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-10-15 14:58:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-15 14:58:30,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:30,666 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:30,666 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:30,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 104445678, now seen corresponding path program 48 times [2018-10-15 14:58:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3806 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-10-15 14:58:31,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:31,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 14:58:31,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 14:58:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 14:58:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:58:31,640 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 51 states. [2018-10-15 14:58:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:33,503 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-10-15 14:58:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 14:58:33,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 333 [2018-10-15 14:58:33,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:33,505 INFO L225 Difference]: With dead ends: 347 [2018-10-15 14:58:33,505 INFO L226 Difference]: Without dead ends: 347 [2018-10-15 14:58:33,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 14:58:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-15 14:58:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2018-10-15 14:58:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-15 14:58:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 343 transitions. [2018-10-15 14:58:33,511 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 343 transitions. Word has length 333 [2018-10-15 14:58:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:33,511 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 343 transitions. [2018-10-15 14:58:33,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 14:58:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 343 transitions. [2018-10-15 14:58:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-15 14:58:33,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:33,513 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:33,513 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:33,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:33,514 INFO L82 PathProgramCache]: Analyzing trace with hash -464380744, now seen corresponding path program 49 times [2018-10-15 14:58:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-15 14:58:34,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 14:58:34,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 14:58:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 14:58:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:58:34,528 INFO L87 Difference]: Start difference. First operand 342 states and 343 transitions. Second operand 55 states. [2018-10-15 14:58:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:36,351 INFO L93 Difference]: Finished difference Result 353 states and 354 transitions. [2018-10-15 14:58:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 14:58:36,352 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 341 [2018-10-15 14:58:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:36,355 INFO L225 Difference]: With dead ends: 353 [2018-10-15 14:58:36,355 INFO L226 Difference]: Without dead ends: 349 [2018-10-15 14:58:36,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3392, Invalid=7950, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 14:58:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-15 14:58:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2018-10-15 14:58:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-15 14:58:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-10-15 14:58:36,361 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 341 [2018-10-15 14:58:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:36,361 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-10-15 14:58:36,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 14:58:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-10-15 14:58:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-15 14:58:36,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:36,364 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:36,364 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:36,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1412143207, now seen corresponding path program 50 times [2018-10-15 14:58:36,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4127 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-10-15 14:58:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:38,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 14:58:38,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 14:58:38,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 14:58:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 14:58:38,376 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 53 states. [2018-10-15 14:58:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:39,956 INFO L93 Difference]: Finished difference Result 360 states and 361 transitions. [2018-10-15 14:58:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 14:58:39,956 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 346 [2018-10-15 14:58:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:39,958 INFO L225 Difference]: With dead ends: 360 [2018-10-15 14:58:39,959 INFO L226 Difference]: Without dead ends: 360 [2018-10-15 14:58:39,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 14:58:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-15 14:58:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 355. [2018-10-15 14:58:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-15 14:58:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-15 14:58:39,963 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 346 [2018-10-15 14:58:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:39,964 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-15 14:58:39,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 14:58:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-15 14:58:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-15 14:58:39,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:39,966 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:39,966 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:39,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash 776550927, now seen corresponding path program 51 times [2018-10-15 14:58:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-10-15 14:58:41,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:41,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 14:58:41,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 14:58:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 14:58:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:58:41,364 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 55 states. [2018-10-15 14:58:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:43,361 INFO L93 Difference]: Finished difference Result 368 states and 369 transitions. [2018-10-15 14:58:43,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 14:58:43,361 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 354 [2018-10-15 14:58:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:43,363 INFO L225 Difference]: With dead ends: 368 [2018-10-15 14:58:43,363 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 14:58:43,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 14:58:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 14:58:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 363. [2018-10-15 14:58:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-15 14:58:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-10-15 14:58:43,366 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 354 [2018-10-15 14:58:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:43,367 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-10-15 14:58:43,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 14:58:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-10-15 14:58:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-15 14:58:43,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:43,368 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:43,369 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:43,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2002204293, now seen corresponding path program 52 times [2018-10-15 14:58:43,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-15 14:58:44,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:44,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 14:58:44,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 14:58:44,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 14:58:44,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=2405, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 14:58:44,471 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 57 states. [2018-10-15 14:58:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:46,422 INFO L93 Difference]: Finished difference Result 374 states and 375 transitions. [2018-10-15 14:58:46,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 14:58:46,422 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 362 [2018-10-15 14:58:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:46,424 INFO L225 Difference]: With dead ends: 374 [2018-10-15 14:58:46,424 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 14:58:46,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3657, Invalid=8553, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 14:58:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 14:58:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2018-10-15 14:58:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 14:58:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 369 transitions. [2018-10-15 14:58:46,430 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 369 transitions. Word has length 362 [2018-10-15 14:58:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:46,430 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 369 transitions. [2018-10-15 14:58:46,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 14:58:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 369 transitions. [2018-10-15 14:58:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-15 14:58:46,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:46,432 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:46,433 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:46,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:46,433 INFO L82 PathProgramCache]: Analyzing trace with hash 988308972, now seen corresponding path program 53 times [2018-10-15 14:58:46,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-15 14:58:48,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:48,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 14:58:48,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 14:58:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 14:58:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2578, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:58:48,071 INFO L87 Difference]: Start difference. First operand 368 states and 369 transitions. Second operand 59 states. [2018-10-15 14:58:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:49,900 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-10-15 14:58:49,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 14:58:49,901 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 367 [2018-10-15 14:58:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:49,903 INFO L225 Difference]: With dead ends: 379 [2018-10-15 14:58:49,903 INFO L226 Difference]: Without dead ends: 375 [2018-10-15 14:58:49,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3932, Invalid=9178, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 14:58:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-15 14:58:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2018-10-15 14:58:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-15 14:58:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-10-15 14:58:49,908 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 367 [2018-10-15 14:58:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:49,909 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-10-15 14:58:49,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 14:58:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-10-15 14:58:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-15 14:58:49,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:49,911 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:49,911 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:49,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:49,912 INFO L82 PathProgramCache]: Analyzing trace with hash -310395163, now seen corresponding path program 54 times [2018-10-15 14:58:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4808 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-15 14:58:51,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:51,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 14:58:51,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 14:58:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 14:58:51,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2757, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 14:58:51,342 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 61 states. [2018-10-15 14:58:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:53,727 INFO L93 Difference]: Finished difference Result 384 states and 385 transitions. [2018-10-15 14:58:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 14:58:53,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 372 [2018-10-15 14:58:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:53,730 INFO L225 Difference]: With dead ends: 384 [2018-10-15 14:58:53,730 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 14:58:53,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4217, Invalid=9825, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 14:58:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 14:58:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2018-10-15 14:58:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-15 14:58:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-10-15 14:58:53,734 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 372 [2018-10-15 14:58:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:53,734 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-10-15 14:58:53,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 14:58:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-10-15 14:58:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-15 14:58:53,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:53,736 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:53,736 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:53,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash 346429836, now seen corresponding path program 55 times [2018-10-15 14:58:53,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2018-10-15 14:58:54,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:54,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 14:58:54,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 14:58:54,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 14:58:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2942, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:58:54,981 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 63 states. [2018-10-15 14:58:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:57,322 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-10-15 14:58:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 14:58:57,322 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 377 [2018-10-15 14:58:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:57,324 INFO L225 Difference]: With dead ends: 389 [2018-10-15 14:58:57,324 INFO L226 Difference]: Without dead ends: 385 [2018-10-15 14:58:57,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4512, Invalid=10494, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 14:58:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-15 14:58:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2018-10-15 14:58:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-15 14:58:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-10-15 14:58:57,328 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 377 [2018-10-15 14:58:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:57,328 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-10-15 14:58:57,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 14:58:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-10-15 14:58:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-15 14:58:57,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:57,330 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:57,331 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:57,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 643911493, now seen corresponding path program 56 times [2018-10-15 14:58:57,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5097 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-10-15 14:58:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:58,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 14:58:58,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 14:58:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 14:58:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 14:58:58,908 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 57 states. [2018-10-15 14:59:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:00,711 INFO L93 Difference]: Finished difference Result 396 states and 397 transitions. [2018-10-15 14:59:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 14:59:00,712 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 382 [2018-10-15 14:59:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:00,714 INFO L225 Difference]: With dead ends: 396 [2018-10-15 14:59:00,714 INFO L226 Difference]: Without dead ends: 396 [2018-10-15 14:59:00,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 14:59:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-15 14:59:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 391. [2018-10-15 14:59:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-15 14:59:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-10-15 14:59:00,719 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 382 [2018-10-15 14:59:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:00,719 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-10-15 14:59:00,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 14:59:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-10-15 14:59:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-15 14:59:00,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:00,722 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:00,722 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:00,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 967876283, now seen corresponding path program 57 times [2018-10-15 14:59:00,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5315 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:02,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 14:59:02,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 14:59:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 14:59:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=3133, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 14:59:02,028 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 65 states. [2018-10-15 14:59:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:04,807 INFO L93 Difference]: Finished difference Result 402 states and 403 transitions. [2018-10-15 14:59:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 14:59:04,807 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 390 [2018-10-15 14:59:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:04,810 INFO L225 Difference]: With dead ends: 402 [2018-10-15 14:59:04,810 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 14:59:04,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4817, Invalid=11185, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 14:59:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 14:59:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2018-10-15 14:59:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-15 14:59:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 397 transitions. [2018-10-15 14:59:04,814 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 397 transitions. Word has length 390 [2018-10-15 14:59:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:04,814 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 397 transitions. [2018-10-15 14:59:04,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 14:59:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 397 transitions. [2018-10-15 14:59:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-15 14:59:04,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:04,816 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:04,816 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:04,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -598364298, now seen corresponding path program 58 times [2018-10-15 14:59:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5467 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:06,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:06,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 14:59:06,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 14:59:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 14:59:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=3330, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:59:06,730 INFO L87 Difference]: Start difference. First operand 396 states and 397 transitions. Second operand 67 states. [2018-10-15 14:59:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:09,403 INFO L93 Difference]: Finished difference Result 407 states and 408 transitions. [2018-10-15 14:59:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 14:59:09,403 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 395 [2018-10-15 14:59:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:09,406 INFO L225 Difference]: With dead ends: 407 [2018-10-15 14:59:09,406 INFO L226 Difference]: Without dead ends: 403 [2018-10-15 14:59:09,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5132, Invalid=11898, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 14:59:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-15 14:59:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2018-10-15 14:59:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-15 14:59:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-10-15 14:59:09,410 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 395 [2018-10-15 14:59:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:09,410 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-10-15 14:59:09,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 14:59:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-10-15 14:59:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-15 14:59:09,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:09,412 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:09,412 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:09,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1519068261, now seen corresponding path program 59 times [2018-10-15 14:59:09,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5624 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:10,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:10,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 14:59:10,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 14:59:10,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 14:59:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1159, Invalid=3533, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 14:59:10,873 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 69 states. [2018-10-15 14:59:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:13,529 INFO L93 Difference]: Finished difference Result 412 states and 413 transitions. [2018-10-15 14:59:13,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 14:59:13,529 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 400 [2018-10-15 14:59:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:13,532 INFO L225 Difference]: With dead ends: 412 [2018-10-15 14:59:13,532 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 14:59:13,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5457, Invalid=12633, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 14:59:13,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 14:59:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2018-10-15 14:59:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-15 14:59:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 407 transitions. [2018-10-15 14:59:13,536 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 407 transitions. Word has length 400 [2018-10-15 14:59:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:13,536 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 407 transitions. [2018-10-15 14:59:13,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 14:59:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 407 transitions. [2018-10-15 14:59:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-15 14:59:13,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:13,538 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:13,539 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:13,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 202669718, now seen corresponding path program 60 times [2018-10-15 14:59:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5786 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:15,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:15,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 14:59:15,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 14:59:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 14:59:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3742, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:59:15,168 INFO L87 Difference]: Start difference. First operand 406 states and 407 transitions. Second operand 71 states. [2018-10-15 14:59:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:17,774 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-10-15 14:59:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 14:59:17,775 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 405 [2018-10-15 14:59:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:17,777 INFO L225 Difference]: With dead ends: 417 [2018-10-15 14:59:17,777 INFO L226 Difference]: Without dead ends: 413 [2018-10-15 14:59:17,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5792, Invalid=13390, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 14:59:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-15 14:59:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2018-10-15 14:59:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-15 14:59:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-10-15 14:59:17,782 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 405 [2018-10-15 14:59:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:17,782 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-10-15 14:59:17,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 14:59:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-10-15 14:59:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-15 14:59:17,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:17,784 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:17,784 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:17,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 238715003, now seen corresponding path program 61 times [2018-10-15 14:59:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5953 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:19,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:19,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 14:59:19,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 14:59:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 14:59:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=3957, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 14:59:19,805 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 73 states. [2018-10-15 14:59:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:22,603 INFO L93 Difference]: Finished difference Result 422 states and 423 transitions. [2018-10-15 14:59:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 14:59:22,604 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 410 [2018-10-15 14:59:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:22,606 INFO L225 Difference]: With dead ends: 422 [2018-10-15 14:59:22,606 INFO L226 Difference]: Without dead ends: 418 [2018-10-15 14:59:22,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6137, Invalid=14169, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 14:59:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-15 14:59:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2018-10-15 14:59:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 14:59:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 417 transitions. [2018-10-15 14:59:22,611 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 417 transitions. Word has length 410 [2018-10-15 14:59:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:22,611 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 417 transitions. [2018-10-15 14:59:22,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 14:59:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 417 transitions. [2018-10-15 14:59:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 14:59:22,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:22,613 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:22,613 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:22,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:22,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1351424586, now seen corresponding path program 62 times [2018-10-15 14:59:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:24,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:24,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 14:59:24,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 14:59:24,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 14:59:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:59:24,843 INFO L87 Difference]: Start difference. First operand 416 states and 417 transitions. Second operand 75 states. [2018-10-15 14:59:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:27,915 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-10-15 14:59:27,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 14:59:27,916 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 415 [2018-10-15 14:59:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:27,918 INFO L225 Difference]: With dead ends: 427 [2018-10-15 14:59:27,918 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 14:59:27,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 14:59:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 14:59:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2018-10-15 14:59:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-15 14:59:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-10-15 14:59:27,923 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 415 [2018-10-15 14:59:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:27,923 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-10-15 14:59:27,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 14:59:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-10-15 14:59:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-15 14:59:27,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:27,926 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:27,926 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:27,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -815821477, now seen corresponding path program 63 times [2018-10-15 14:59:27,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:29,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:29,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 14:59:29,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 14:59:29,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 14:59:29,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 14:59:29,976 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 77 states. [2018-10-15 14:59:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:33,291 INFO L93 Difference]: Finished difference Result 432 states and 433 transitions. [2018-10-15 14:59:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 14:59:33,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 420 [2018-10-15 14:59:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:33,294 INFO L225 Difference]: With dead ends: 432 [2018-10-15 14:59:33,294 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 14:59:33,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6857, Invalid=15793, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 14:59:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 14:59:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-10-15 14:59:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-15 14:59:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 427 transitions. [2018-10-15 14:59:33,299 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 427 transitions. Word has length 420 [2018-10-15 14:59:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:33,299 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 427 transitions. [2018-10-15 14:59:33,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 14:59:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 427 transitions. [2018-10-15 14:59:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-10-15 14:59:33,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:33,302 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:33,302 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:33,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash -707599146, now seen corresponding path program 64 times [2018-10-15 14:59:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6484 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-15 14:59:35,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:35,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 14:59:35,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 14:59:35,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 14:59:35,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=4638, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:59:35,418 INFO L87 Difference]: Start difference. First operand 426 states and 427 transitions. Second operand 79 states. [2018-10-15 14:59:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:39,364 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-10-15 14:59:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 14:59:39,365 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 425 [2018-10-15 14:59:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:39,367 INFO L225 Difference]: With dead ends: 437 [2018-10-15 14:59:39,367 INFO L226 Difference]: Without dead ends: 433 [2018-10-15 14:59:39,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7232, Invalid=16638, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 14:59:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-15 14:59:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2018-10-15 14:59:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-15 14:59:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-10-15 14:59:39,372 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 425 [2018-10-15 14:59:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:39,372 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-10-15 14:59:39,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 14:59:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-10-15 14:59:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-15 14:59:39,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:39,374 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:39,374 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:39,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 650248763, now seen corresponding path program 65 times [2018-10-15 14:59:39,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6671 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2018-10-15 14:59:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:40,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 14:59:40,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 14:59:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 14:59:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:59:40,532 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 59 states. [2018-10-15 14:59:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:42,519 INFO L93 Difference]: Finished difference Result 444 states and 445 transitions. [2018-10-15 14:59:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 14:59:42,519 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 430 [2018-10-15 14:59:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:42,522 INFO L225 Difference]: With dead ends: 444 [2018-10-15 14:59:42,522 INFO L226 Difference]: Without dead ends: 444 [2018-10-15 14:59:42,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 14:59:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-15 14:59:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2018-10-15 14:59:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 14:59:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-10-15 14:59:42,526 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 430 [2018-10-15 14:59:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:42,526 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-10-15 14:59:42,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 14:59:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-10-15 14:59:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 14:59:42,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:42,528 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:42,528 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:42,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash 282033, now seen corresponding path program 66 times [2018-10-15 14:59:42,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6897 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-15 14:59:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 14:59:44,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 14:59:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 14:59:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=4877, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 14:59:44,678 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 81 states. [2018-10-15 14:59:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:47,926 INFO L93 Difference]: Finished difference Result 450 states and 451 transitions. [2018-10-15 14:59:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 14:59:47,927 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 438 [2018-10-15 14:59:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:47,929 INFO L225 Difference]: With dead ends: 450 [2018-10-15 14:59:47,929 INFO L226 Difference]: Without dead ends: 446 [2018-10-15 14:59:47,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7617, Invalid=17505, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 14:59:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-15 14:59:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2018-10-15 14:59:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-15 14:59:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 445 transitions. [2018-10-15 14:59:47,934 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 445 transitions. Word has length 438 [2018-10-15 14:59:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:47,934 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 445 transitions. [2018-10-15 14:59:47,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 14:59:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 445 transitions. [2018-10-15 14:59:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-10-15 14:59:47,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:47,936 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:47,936 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:47,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1595479488, now seen corresponding path program 67 times [2018-10-15 14:59:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7089 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-15 14:59:50,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:50,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 14:59:50,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 14:59:50,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 14:59:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=5122, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:59:50,298 INFO L87 Difference]: Start difference. First operand 444 states and 445 transitions. Second operand 83 states. [2018-10-15 14:59:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:54,150 INFO L93 Difference]: Finished difference Result 455 states and 456 transitions. [2018-10-15 14:59:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 14:59:54,150 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 443 [2018-10-15 14:59:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:54,153 INFO L225 Difference]: With dead ends: 455 [2018-10-15 14:59:54,153 INFO L226 Difference]: Without dead ends: 451 [2018-10-15 14:59:54,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8012, Invalid=18394, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 14:59:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-15 14:59:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2018-10-15 14:59:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-15 14:59:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-10-15 14:59:54,157 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 443 [2018-10-15 14:59:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:54,157 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-10-15 14:59:54,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 14:59:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-10-15 14:59:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-15 14:59:54,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:54,159 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:54,159 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:54,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1699401489, now seen corresponding path program 68 times [2018-10-15 14:59:54,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7286 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2018-10-15 14:59:56,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:56,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 14:59:56,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 14:59:56,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 14:59:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5373, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 14:59:56,580 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 85 states. [2018-10-15 15:00:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:00,636 INFO L93 Difference]: Finished difference Result 460 states and 461 transitions. [2018-10-15 15:00:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 15:00:00,636 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 448 [2018-10-15 15:00:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:00,639 INFO L225 Difference]: With dead ends: 460 [2018-10-15 15:00:00,639 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 15:00:00,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8417, Invalid=19305, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:00:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 15:00:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2018-10-15 15:00:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-10-15 15:00:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 455 transitions. [2018-10-15 15:00:00,644 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 455 transitions. Word has length 448 [2018-10-15 15:00:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:00,644 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 455 transitions. [2018-10-15 15:00:00,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:00:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 455 transitions. [2018-10-15 15:00:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-10-15 15:00:00,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:00,646 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:00,646 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:00,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1549419744, now seen corresponding path program 69 times [2018-10-15 15:00:00,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7488 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2018-10-15 15:00:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:01,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:00:01,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:00:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:00:01,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:00:01,854 INFO L87 Difference]: Start difference. First operand 454 states and 455 transitions. Second operand 61 states. [2018-10-15 15:00:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:04,150 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-10-15 15:00:04,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:00:04,151 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 453 [2018-10-15 15:00:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:04,153 INFO L225 Difference]: With dead ends: 467 [2018-10-15 15:00:04,153 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 15:00:04,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:00:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 15:00:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 462. [2018-10-15 15:00:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-15 15:00:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 463 transitions. [2018-10-15 15:00:04,158 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 463 transitions. Word has length 453 [2018-10-15 15:00:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:04,158 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 463 transitions. [2018-10-15 15:00:04,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:00:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 463 transitions. [2018-10-15 15:00:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-15 15:00:04,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:04,160 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:04,161 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:04,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:04,161 INFO L82 PathProgramCache]: Analyzing trace with hash -697600854, now seen corresponding path program 70 times [2018-10-15 15:00:04,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7722 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:00:06,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:00:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:00:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5630, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:00:06,557 INFO L87 Difference]: Start difference. First operand 462 states and 463 transitions. Second operand 87 states. [2018-10-15 15:00:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:11,079 INFO L93 Difference]: Finished difference Result 473 states and 474 transitions. [2018-10-15 15:00:11,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 15:00:11,079 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 461 [2018-10-15 15:00:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:11,081 INFO L225 Difference]: With dead ends: 473 [2018-10-15 15:00:11,081 INFO L226 Difference]: Without dead ends: 469 [2018-10-15 15:00:11,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8832, Invalid=20238, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:00:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-10-15 15:00:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2018-10-15 15:00:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 15:00:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-10-15 15:00:11,085 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 461 [2018-10-15 15:00:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:11,085 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-10-15 15:00:11,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:00:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-10-15 15:00:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 15:00:11,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:11,088 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:11,088 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:11,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 871249639, now seen corresponding path program 71 times [2018-10-15 15:00:11,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7929 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:13,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:13,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:00:13,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:00:13,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:00:13,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=5893, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:00:13,451 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 89 states. [2018-10-15 15:00:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:17,767 INFO L93 Difference]: Finished difference Result 478 states and 479 transitions. [2018-10-15 15:00:17,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 15:00:17,767 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 466 [2018-10-15 15:00:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:17,770 INFO L225 Difference]: With dead ends: 478 [2018-10-15 15:00:17,770 INFO L226 Difference]: Without dead ends: 474 [2018-10-15 15:00:17,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9257, Invalid=21193, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 15:00:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-10-15 15:00:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 472. [2018-10-15 15:00:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-15 15:00:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 473 transitions. [2018-10-15 15:00:17,775 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 473 transitions. Word has length 466 [2018-10-15 15:00:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:17,775 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 473 transitions. [2018-10-15 15:00:17,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:00:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 473 transitions. [2018-10-15 15:00:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-15 15:00:17,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:17,777 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:17,778 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:17,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1810649802, now seen corresponding path program 72 times [2018-10-15 15:00:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8141 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:20,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:20,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:00:20,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:00:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:00:20,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=6162, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:00:20,749 INFO L87 Difference]: Start difference. First operand 472 states and 473 transitions. Second operand 91 states. [2018-10-15 15:00:25,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:25,456 INFO L93 Difference]: Finished difference Result 483 states and 484 transitions. [2018-10-15 15:00:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 15:00:25,457 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 471 [2018-10-15 15:00:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:25,459 INFO L225 Difference]: With dead ends: 483 [2018-10-15 15:00:25,459 INFO L226 Difference]: Without dead ends: 479 [2018-10-15 15:00:25,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9692, Invalid=22170, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:00:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-15 15:00:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2018-10-15 15:00:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-10-15 15:00:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 478 transitions. [2018-10-15 15:00:25,464 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 478 transitions. Word has length 471 [2018-10-15 15:00:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:25,464 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 478 transitions. [2018-10-15 15:00:25,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:00:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 478 transitions. [2018-10-15 15:00:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2018-10-15 15:00:25,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:25,466 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:25,466 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:25,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash 417541319, now seen corresponding path program 73 times [2018-10-15 15:00:25,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8358 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:28,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:28,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:00:28,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:00:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:00:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=6437, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:00:28,056 INFO L87 Difference]: Start difference. First operand 477 states and 478 transitions. Second operand 93 states. [2018-10-15 15:00:32,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:32,593 INFO L93 Difference]: Finished difference Result 488 states and 489 transitions. [2018-10-15 15:00:32,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 15:00:32,593 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 476 [2018-10-15 15:00:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:32,596 INFO L225 Difference]: With dead ends: 488 [2018-10-15 15:00:32,596 INFO L226 Difference]: Without dead ends: 484 [2018-10-15 15:00:32,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10137, Invalid=23169, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 15:00:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-15 15:00:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2018-10-15 15:00:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-15 15:00:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 483 transitions. [2018-10-15 15:00:32,601 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 483 transitions. Word has length 476 [2018-10-15 15:00:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:32,601 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 483 transitions. [2018-10-15 15:00:32,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:00:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 483 transitions. [2018-10-15 15:00:32,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-10-15 15:00:32,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:32,603 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:32,603 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:32,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:32,604 INFO L82 PathProgramCache]: Analyzing trace with hash 285608170, now seen corresponding path program 74 times [2018-10-15 15:00:32,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:35,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:35,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:00:35,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:00:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:00:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=6718, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:00:35,287 INFO L87 Difference]: Start difference. First operand 482 states and 483 transitions. Second operand 95 states. [2018-10-15 15:00:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:40,243 INFO L93 Difference]: Finished difference Result 493 states and 494 transitions. [2018-10-15 15:00:40,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 15:00:40,243 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 481 [2018-10-15 15:00:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:40,244 INFO L225 Difference]: With dead ends: 493 [2018-10-15 15:00:40,245 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 15:00:40,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10592, Invalid=24190, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:00:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 15:00:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 487. [2018-10-15 15:00:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-15 15:00:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 488 transitions. [2018-10-15 15:00:40,249 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 488 transitions. Word has length 481 [2018-10-15 15:00:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:40,249 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 488 transitions. [2018-10-15 15:00:40,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:00:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 488 transitions. [2018-10-15 15:00:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-15 15:00:40,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:40,251 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:40,251 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:40,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2079962457, now seen corresponding path program 75 times [2018-10-15 15:00:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8807 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:43,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:43,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:00:43,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:00:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:00:43,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=7005, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:00:43,047 INFO L87 Difference]: Start difference. First operand 487 states and 488 transitions. Second operand 97 states. [2018-10-15 15:00:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:48,261 INFO L93 Difference]: Finished difference Result 498 states and 499 transitions. [2018-10-15 15:00:48,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:00:48,262 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 486 [2018-10-15 15:00:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:48,265 INFO L225 Difference]: With dead ends: 498 [2018-10-15 15:00:48,265 INFO L226 Difference]: Without dead ends: 494 [2018-10-15 15:00:48,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11057, Invalid=25233, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:00:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-15 15:00:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2018-10-15 15:00:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-15 15:00:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 493 transitions. [2018-10-15 15:00:48,270 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 493 transitions. Word has length 486 [2018-10-15 15:00:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:48,270 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 493 transitions. [2018-10-15 15:00:48,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:00:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 493 transitions. [2018-10-15 15:00:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-15 15:00:48,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:48,273 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:48,273 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:48,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash 512399114, now seen corresponding path program 76 times [2018-10-15 15:00:48,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9039 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:51,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:51,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:00:51,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:00:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:00:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2404, Invalid=7298, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:00:51,236 INFO L87 Difference]: Start difference. First operand 492 states and 493 transitions. Second operand 99 states. [2018-10-15 15:00:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:56,699 INFO L93 Difference]: Finished difference Result 503 states and 504 transitions. [2018-10-15 15:00:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 15:00:56,699 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 491 [2018-10-15 15:00:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:56,702 INFO L225 Difference]: With dead ends: 503 [2018-10-15 15:00:56,702 INFO L226 Difference]: Without dead ends: 499 [2018-10-15 15:00:56,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11532, Invalid=26298, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:00:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-15 15:00:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2018-10-15 15:00:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 15:00:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 498 transitions. [2018-10-15 15:00:56,707 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 498 transitions. Word has length 491 [2018-10-15 15:00:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:56,707 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 498 transitions. [2018-10-15 15:00:56,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:00:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 498 transitions. [2018-10-15 15:00:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-15 15:00:56,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:56,709 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:56,710 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:56,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:56,710 INFO L82 PathProgramCache]: Analyzing trace with hash -809135993, now seen corresponding path program 77 times [2018-10-15 15:00:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9276 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 3540 trivial. 0 not checked. [2018-10-15 15:00:59,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:00:59,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:00:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:00:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:00:59,598 INFO L87 Difference]: Start difference. First operand 497 states and 498 transitions. Second operand 101 states. [2018-10-15 15:01:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:05,127 INFO L93 Difference]: Finished difference Result 508 states and 509 transitions. [2018-10-15 15:01:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 15:01:05,127 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 496 [2018-10-15 15:01:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:05,130 INFO L225 Difference]: With dead ends: 508 [2018-10-15 15:01:05,130 INFO L226 Difference]: Without dead ends: 504 [2018-10-15 15:01:05,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12017, Invalid=27385, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:01:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-15 15:01:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2018-10-15 15:01:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-10-15 15:01:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 503 transitions. [2018-10-15 15:01:05,135 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 503 transitions. Word has length 496 [2018-10-15 15:01:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:05,136 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 503 transitions. [2018-10-15 15:01:05,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:01:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 503 transitions. [2018-10-15 15:01:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-10-15 15:01:05,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:05,138 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:05,138 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:05,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1899234006, now seen corresponding path program 78 times [2018-10-15 15:01:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9518 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 5978 trivial. 0 not checked. [2018-10-15 15:01:06,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:06,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:01:06,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:01:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:01:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:01:06,666 INFO L87 Difference]: Start difference. First operand 502 states and 503 transitions. Second operand 63 states. [2018-10-15 15:01:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:08,956 INFO L93 Difference]: Finished difference Result 515 states and 516 transitions. [2018-10-15 15:01:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:01:08,957 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 501 [2018-10-15 15:01:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:08,959 INFO L225 Difference]: With dead ends: 515 [2018-10-15 15:01:08,959 INFO L226 Difference]: Without dead ends: 515 [2018-10-15 15:01:08,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:01:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-15 15:01:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 510. [2018-10-15 15:01:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 15:01:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 511 transitions. [2018-10-15 15:01:08,964 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 511 transitions. Word has length 501 [2018-10-15 15:01:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:08,964 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 511 transitions. [2018-10-15 15:01:08,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:01:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 511 transitions. [2018-10-15 15:01:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 15:01:08,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:08,967 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:08,967 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:08,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash 683061492, now seen corresponding path program 79 times [2018-10-15 15:01:08,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9760 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 3782 trivial. 0 not checked. [2018-10-15 15:01:12,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:12,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:01:12,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:01:12,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:01:12,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=7902, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:01:12,259 INFO L87 Difference]: Start difference. First operand 510 states and 511 transitions. Second operand 103 states. [2018-10-15 15:01:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:18,020 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-10-15 15:01:18,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 15:01:18,021 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 509 [2018-10-15 15:01:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:18,024 INFO L225 Difference]: With dead ends: 521 [2018-10-15 15:01:18,024 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 15:01:18,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12512, Invalid=28494, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:01:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 15:01:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2018-10-15 15:01:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 15:01:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 516 transitions. [2018-10-15 15:01:18,029 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 516 transitions. Word has length 509 [2018-10-15 15:01:18,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:18,029 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 516 transitions. [2018-10-15 15:01:18,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:01:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 516 transitions. [2018-10-15 15:01:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-15 15:01:18,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:18,033 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:18,033 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:18,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2039421149, now seen corresponding path program 80 times [2018-10-15 15:01:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10007 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 6225 trivial. 0 not checked. [2018-10-15 15:01:19,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:19,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:01:19,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:01:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:01:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:01:19,360 INFO L87 Difference]: Start difference. First operand 515 states and 516 transitions. Second operand 65 states. [2018-10-15 15:01:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:22,038 INFO L93 Difference]: Finished difference Result 528 states and 529 transitions. [2018-10-15 15:01:22,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 15:01:22,039 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 514 [2018-10-15 15:01:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:22,041 INFO L225 Difference]: With dead ends: 528 [2018-10-15 15:01:22,041 INFO L226 Difference]: Without dead ends: 528 [2018-10-15 15:01:22,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:01:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-15 15:01:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 523. [2018-10-15 15:01:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-15 15:01:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 524 transitions. [2018-10-15 15:01:22,045 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 524 transitions. Word has length 514 [2018-10-15 15:01:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:22,046 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 524 transitions. [2018-10-15 15:01:22,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:01:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 524 transitions. [2018-10-15 15:01:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-15 15:01:22,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:22,048 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:22,048 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:22,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash 417357139, now seen corresponding path program 81 times [2018-10-15 15:01:22,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10257 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2018-10-15 15:01:25,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:25,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:01:25,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:01:25,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:01:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2707, Invalid=8213, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:01:25,150 INFO L87 Difference]: Start difference. First operand 523 states and 524 transitions. Second operand 105 states. [2018-10-15 15:01:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:31,177 INFO L93 Difference]: Finished difference Result 534 states and 535 transitions. [2018-10-15 15:01:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 15:01:31,177 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 522 [2018-10-15 15:01:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:31,180 INFO L225 Difference]: With dead ends: 534 [2018-10-15 15:01:31,180 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 15:01:31,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13017, Invalid=29625, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:01:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 15:01:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2018-10-15 15:01:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 15:01:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2018-10-15 15:01:31,185 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 522 [2018-10-15 15:01:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:31,186 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2018-10-15 15:01:31,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:01:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2018-10-15 15:01:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 15:01:31,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:31,188 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:31,188 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:31,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1588416478, now seen corresponding path program 82 times [2018-10-15 15:01:31,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10509 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2018-10-15 15:01:32,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:32,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:01:32,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:01:32,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:01:32,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:01:32,771 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 67 states. [2018-10-15 15:01:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:35,174 INFO L93 Difference]: Finished difference Result 541 states and 542 transitions. [2018-10-15 15:01:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 15:01:35,174 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 527 [2018-10-15 15:01:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:35,177 INFO L225 Difference]: With dead ends: 541 [2018-10-15 15:01:35,177 INFO L226 Difference]: Without dead ends: 541 [2018-10-15 15:01:35,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:01:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-10-15 15:01:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 536. [2018-10-15 15:01:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-15 15:01:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 537 transitions. [2018-10-15 15:01:35,182 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 537 transitions. Word has length 527 [2018-10-15 15:01:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:35,182 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 537 transitions. [2018-10-15 15:01:35,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:01:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 537 transitions. [2018-10-15 15:01:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-10-15 15:01:35,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:35,185 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:35,185 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:35,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash -255493336, now seen corresponding path program 83 times [2018-10-15 15:01:35,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10767 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2018-10-15 15:01:36,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:36,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:01:36,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:01:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:01:36,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:01:36,890 INFO L87 Difference]: Start difference. First operand 536 states and 537 transitions. Second operand 69 states. [2018-10-15 15:01:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:39,550 INFO L93 Difference]: Finished difference Result 549 states and 550 transitions. [2018-10-15 15:01:39,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 15:01:39,551 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 535 [2018-10-15 15:01:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:39,552 INFO L225 Difference]: With dead ends: 549 [2018-10-15 15:01:39,552 INFO L226 Difference]: Without dead ends: 549 [2018-10-15 15:01:39,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:01:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-10-15 15:01:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 544. [2018-10-15 15:01:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-15 15:01:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2018-10-15 15:01:39,559 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 535 [2018-10-15 15:01:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:39,559 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2018-10-15 15:01:39,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:01:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2018-10-15 15:01:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-15 15:01:39,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:39,562 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:39,562 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:39,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:39,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1162525810, now seen corresponding path program 84 times [2018-10-15 15:01:39,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11033 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2018-10-15 15:01:41,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:41,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:01:41,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:01:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:01:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:01:41,084 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 71 states. [2018-10-15 15:01:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:43,873 INFO L93 Difference]: Finished difference Result 557 states and 558 transitions. [2018-10-15 15:01:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 15:01:43,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 543 [2018-10-15 15:01:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:43,876 INFO L225 Difference]: With dead ends: 557 [2018-10-15 15:01:43,876 INFO L226 Difference]: Without dead ends: 557 [2018-10-15 15:01:43,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:01:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-15 15:01:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 552. [2018-10-15 15:01:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-15 15:01:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2018-10-15 15:01:43,881 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 543 [2018-10-15 15:01:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:43,882 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2018-10-15 15:01:43,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:01:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2018-10-15 15:01:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-15 15:01:43,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:43,885 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:43,885 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:43,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2134436932, now seen corresponding path program 85 times [2018-10-15 15:01:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11307 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2018-10-15 15:01:45,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:45,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:01:45,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:01:45,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:01:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:01:45,533 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 73 states. [2018-10-15 15:01:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:48,679 INFO L93 Difference]: Finished difference Result 565 states and 566 transitions. [2018-10-15 15:01:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:01:48,679 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 551 [2018-10-15 15:01:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:48,682 INFO L225 Difference]: With dead ends: 565 [2018-10-15 15:01:48,682 INFO L226 Difference]: Without dead ends: 565 [2018-10-15 15:01:48,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:01:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-15 15:01:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 560. [2018-10-15 15:01:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 15:01:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 561 transitions. [2018-10-15 15:01:48,687 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 561 transitions. Word has length 551 [2018-10-15 15:01:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:48,687 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 561 transitions. [2018-10-15 15:01:48,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:01:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 561 transitions. [2018-10-15 15:01:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 15:01:48,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:48,690 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:48,690 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:48,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1648066298, now seen corresponding path program 86 times [2018-10-15 15:01:48,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11589 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 6477 trivial. 0 not checked. [2018-10-15 15:01:50,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:50,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:01:50,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:01:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:01:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:01:50,426 INFO L87 Difference]: Start difference. First operand 560 states and 561 transitions. Second operand 75 states. [2018-10-15 15:01:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:53,791 INFO L93 Difference]: Finished difference Result 573 states and 574 transitions. [2018-10-15 15:01:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 15:01:53,791 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 559 [2018-10-15 15:01:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:53,793 INFO L225 Difference]: With dead ends: 573 [2018-10-15 15:01:53,793 INFO L226 Difference]: Without dead ends: 573 [2018-10-15 15:01:53,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:01:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-10-15 15:01:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 568. [2018-10-15 15:01:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-10-15 15:01:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 569 transitions. [2018-10-15 15:01:53,798 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 569 transitions. Word has length 559 [2018-10-15 15:01:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:53,798 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 569 transitions. [2018-10-15 15:01:53,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:01:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 569 transitions. [2018-10-15 15:01:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-15 15:01:53,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:53,801 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:53,801 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:53,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1825375312, now seen corresponding path program 87 times [2018-10-15 15:01:53,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11879 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:01:57,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:57,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:01:57,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:01:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:01:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2812, Invalid=8530, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:01:57,184 INFO L87 Difference]: Start difference. First operand 568 states and 569 transitions. Second operand 107 states. [2018-10-15 15:02:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:03,427 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-10-15 15:02:03,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 15:02:03,427 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 567 [2018-10-15 15:02:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:03,430 INFO L225 Difference]: With dead ends: 579 [2018-10-15 15:02:03,430 INFO L226 Difference]: Without dead ends: 575 [2018-10-15 15:02:03,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13532, Invalid=30778, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:02:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-10-15 15:02:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2018-10-15 15:02:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-15 15:02:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 574 transitions. [2018-10-15 15:02:03,437 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 574 transitions. Word has length 567 [2018-10-15 15:02:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:03,437 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 574 transitions. [2018-10-15 15:02:03,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:02:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 574 transitions. [2018-10-15 15:02:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-15 15:02:03,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:03,440 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:03,440 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:03,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:03,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1837990143, now seen corresponding path program 88 times [2018-10-15 15:02:03,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12136 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:02:06,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:06,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:02:06,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:02:06,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:02:06,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2919, Invalid=8853, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:02:06,831 INFO L87 Difference]: Start difference. First operand 573 states and 574 transitions. Second operand 109 states. [2018-10-15 15:02:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:13,579 INFO L93 Difference]: Finished difference Result 584 states and 585 transitions. [2018-10-15 15:02:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 15:02:13,580 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 572 [2018-10-15 15:02:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:13,583 INFO L225 Difference]: With dead ends: 584 [2018-10-15 15:02:13,583 INFO L226 Difference]: Without dead ends: 580 [2018-10-15 15:02:13,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14057, Invalid=31953, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 15:02:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-10-15 15:02:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-10-15 15:02:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-10-15 15:02:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 579 transitions. [2018-10-15 15:02:13,589 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 579 transitions. Word has length 572 [2018-10-15 15:02:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:13,589 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 579 transitions. [2018-10-15 15:02:13,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:02:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 579 transitions. [2018-10-15 15:02:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-10-15 15:02:13,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:13,592 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:13,592 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:13,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1993143568, now seen corresponding path program 89 times [2018-10-15 15:02:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12398 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:02:17,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:17,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:02:17,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:02:17,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:02:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3028, Invalid=9182, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:02:17,050 INFO L87 Difference]: Start difference. First operand 578 states and 579 transitions. Second operand 111 states. [2018-10-15 15:02:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:24,076 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-10-15 15:02:24,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:02:24,076 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 577 [2018-10-15 15:02:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:24,079 INFO L225 Difference]: With dead ends: 589 [2018-10-15 15:02:24,079 INFO L226 Difference]: Without dead ends: 585 [2018-10-15 15:02:24,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14592, Invalid=33150, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 15:02:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-15 15:02:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2018-10-15 15:02:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-10-15 15:02:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-10-15 15:02:24,085 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 577 [2018-10-15 15:02:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:24,086 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-10-15 15:02:24,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:02:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-10-15 15:02:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-15 15:02:24,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:24,088 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:24,089 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:24,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1813537695, now seen corresponding path program 90 times [2018-10-15 15:02:24,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12665 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:02:27,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:27,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:02:27,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:02:27,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:02:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=9517, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:02:27,725 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 113 states. [2018-10-15 15:02:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:34,624 INFO L93 Difference]: Finished difference Result 594 states and 595 transitions. [2018-10-15 15:02:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 15:02:34,624 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 582 [2018-10-15 15:02:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:34,627 INFO L225 Difference]: With dead ends: 594 [2018-10-15 15:02:34,628 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 15:02:34,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15137, Invalid=34369, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:02:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 15:02:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2018-10-15 15:02:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-15 15:02:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 589 transitions. [2018-10-15 15:02:34,633 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 589 transitions. Word has length 582 [2018-10-15 15:02:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:34,634 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 589 transitions. [2018-10-15 15:02:34,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:02:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 589 transitions. [2018-10-15 15:02:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-10-15 15:02:34,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:34,636 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:34,636 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:34,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1228491152, now seen corresponding path program 91 times [2018-10-15 15:02:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12937 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:02:38,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:38,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:02:38,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:02:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:02:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=9858, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:02:38,554 INFO L87 Difference]: Start difference. First operand 588 states and 589 transitions. Second operand 115 states. [2018-10-15 15:02:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:45,289 INFO L93 Difference]: Finished difference Result 599 states and 600 transitions. [2018-10-15 15:02:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 15:02:45,289 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 587 [2018-10-15 15:02:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:45,292 INFO L225 Difference]: With dead ends: 599 [2018-10-15 15:02:45,293 INFO L226 Difference]: Without dead ends: 595 [2018-10-15 15:02:45,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15692, Invalid=35610, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 15:02:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-10-15 15:02:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2018-10-15 15:02:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-10-15 15:02:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2018-10-15 15:02:45,299 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 587 [2018-10-15 15:02:45,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:45,299 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2018-10-15 15:02:45,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:02:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2018-10-15 15:02:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-10-15 15:02:45,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:45,302 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:45,302 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:45,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash -987790911, now seen corresponding path program 92 times [2018-10-15 15:02:45,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13214 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:02:49,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:49,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:02:49,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:02:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:02:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=10205, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:02:49,385 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand 117 states. [2018-10-15 15:02:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:56,390 INFO L93 Difference]: Finished difference Result 604 states and 605 transitions. [2018-10-15 15:02:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 15:02:56,391 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 592 [2018-10-15 15:02:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:56,395 INFO L225 Difference]: With dead ends: 604 [2018-10-15 15:02:56,395 INFO L226 Difference]: Without dead ends: 600 [2018-10-15 15:02:56,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16257, Invalid=36873, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 15:02:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-10-15 15:02:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2018-10-15 15:02:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-10-15 15:02:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 599 transitions. [2018-10-15 15:02:56,402 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 599 transitions. Word has length 592 [2018-10-15 15:02:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:56,403 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 599 transitions. [2018-10-15 15:02:56,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:02:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 599 transitions. [2018-10-15 15:02:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-10-15 15:02:56,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:56,407 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:56,407 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:56,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1409695696, now seen corresponding path program 93 times [2018-10-15 15:02:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13496 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:03:00,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:00,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:03:00,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:03:00,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:03:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3484, Invalid=10558, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:03:00,563 INFO L87 Difference]: Start difference. First operand 598 states and 599 transitions. Second operand 119 states. [2018-10-15 15:03:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:07,815 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2018-10-15 15:03:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 15:03:07,815 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 597 [2018-10-15 15:03:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:07,819 INFO L225 Difference]: With dead ends: 609 [2018-10-15 15:03:07,819 INFO L226 Difference]: Without dead ends: 605 [2018-10-15 15:03:07,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16832, Invalid=38158, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 15:03:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-15 15:03:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2018-10-15 15:03:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-15 15:03:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 604 transitions. [2018-10-15 15:03:07,826 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 604 transitions. Word has length 597 [2018-10-15 15:03:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:07,826 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 604 transitions. [2018-10-15 15:03:07,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:03:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 604 transitions. [2018-10-15 15:03:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-15 15:03:07,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:07,830 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:07,830 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:07,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2025836767, now seen corresponding path program 94 times [2018-10-15 15:03:07,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13783 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:03:12,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:12,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:03:12,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:03:12,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:03:12,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3603, Invalid=10917, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:03:12,124 INFO L87 Difference]: Start difference. First operand 603 states and 604 transitions. Second operand 121 states. [2018-10-15 15:03:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:20,071 INFO L93 Difference]: Finished difference Result 614 states and 615 transitions. [2018-10-15 15:03:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 15:03:20,071 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 602 [2018-10-15 15:03:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:20,074 INFO L225 Difference]: With dead ends: 614 [2018-10-15 15:03:20,074 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 15:03:20,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=17417, Invalid=39465, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:03:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 15:03:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 608. [2018-10-15 15:03:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-15 15:03:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 609 transitions. [2018-10-15 15:03:20,081 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 609 transitions. Word has length 602 [2018-10-15 15:03:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:20,081 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 609 transitions. [2018-10-15 15:03:20,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:03:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 609 transitions. [2018-10-15 15:03:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2018-10-15 15:03:20,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:20,085 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:20,086 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:20,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 403599056, now seen corresponding path program 95 times [2018-10-15 15:03:20,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14075 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:03:24,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:24,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:03:24,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:03:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:03:24,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3724, Invalid=11282, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:03:24,731 INFO L87 Difference]: Start difference. First operand 608 states and 609 transitions. Second operand 123 states. [2018-10-15 15:03:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:32,790 INFO L93 Difference]: Finished difference Result 619 states and 620 transitions. [2018-10-15 15:03:32,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 15:03:32,791 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 607 [2018-10-15 15:03:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:32,793 INFO L225 Difference]: With dead ends: 619 [2018-10-15 15:03:32,794 INFO L226 Difference]: Without dead ends: 615 [2018-10-15 15:03:32,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=18012, Invalid=40794, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 15:03:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-10-15 15:03:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 613. [2018-10-15 15:03:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-10-15 15:03:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 614 transitions. [2018-10-15 15:03:32,801 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 614 transitions. Word has length 607 [2018-10-15 15:03:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:32,802 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 614 transitions. [2018-10-15 15:03:32,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:03:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 614 transitions. [2018-10-15 15:03:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-15 15:03:32,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:32,805 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:32,806 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:32,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2081446783, now seen corresponding path program 96 times [2018-10-15 15:03:32,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14372 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:03:37,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:37,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:03:37,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:03:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:03:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=11653, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:03:37,478 INFO L87 Difference]: Start difference. First operand 613 states and 614 transitions. Second operand 125 states. [2018-10-15 15:03:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:45,880 INFO L93 Difference]: Finished difference Result 624 states and 625 transitions. [2018-10-15 15:03:45,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:03:45,881 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 612 [2018-10-15 15:03:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:45,883 INFO L225 Difference]: With dead ends: 624 [2018-10-15 15:03:45,883 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 15:03:45,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18617, Invalid=42145, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 15:03:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 15:03:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2018-10-15 15:03:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-15 15:03:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 619 transitions. [2018-10-15 15:03:45,889 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 619 transitions. Word has length 612 [2018-10-15 15:03:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:45,889 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 619 transitions. [2018-10-15 15:03:45,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:03:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 619 transitions. [2018-10-15 15:03:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-10-15 15:03:45,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:45,892 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:45,892 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:45,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -74361488, now seen corresponding path program 97 times [2018-10-15 15:03:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14674 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:03:50,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:50,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:03:50,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:03:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:03:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3972, Invalid=12030, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:03:50,714 INFO L87 Difference]: Start difference. First operand 618 states and 619 transitions. Second operand 127 states. [2018-10-15 15:03:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:58,795 INFO L93 Difference]: Finished difference Result 629 states and 630 transitions. [2018-10-15 15:03:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 15:03:58,796 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 617 [2018-10-15 15:03:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:58,798 INFO L225 Difference]: With dead ends: 629 [2018-10-15 15:03:58,798 INFO L226 Difference]: Without dead ends: 625 [2018-10-15 15:03:58,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=19232, Invalid=43518, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:03:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-15 15:03:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 623. [2018-10-15 15:03:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 15:03:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2018-10-15 15:03:58,804 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 617 [2018-10-15 15:03:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:58,804 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2018-10-15 15:03:58,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:03:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2018-10-15 15:03:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 15:03:58,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:58,807 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:58,807 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:58,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 223601121, now seen corresponding path program 98 times [2018-10-15 15:03:58,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14981 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:04:03,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:03,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:04:03,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:04:03,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:04:03,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=12413, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:04:03,714 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 129 states. [2018-10-15 15:04:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:12,717 INFO L93 Difference]: Finished difference Result 634 states and 635 transitions. [2018-10-15 15:04:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 15:04:12,717 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 622 [2018-10-15 15:04:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:12,719 INFO L225 Difference]: With dead ends: 634 [2018-10-15 15:04:12,719 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 15:04:12,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=19857, Invalid=44913, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 15:04:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 15:04:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2018-10-15 15:04:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-15 15:04:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 629 transitions. [2018-10-15 15:04:12,724 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 629 transitions. Word has length 622 [2018-10-15 15:04:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:12,724 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 629 transitions. [2018-10-15 15:04:12,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:04:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 629 transitions. [2018-10-15 15:04:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-15 15:04:12,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:12,727 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:12,728 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:12,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1813804048, now seen corresponding path program 99 times [2018-10-15 15:04:12,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15293 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 5402 trivial. 0 not checked. [2018-10-15 15:04:18,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:18,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:04:18,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:04:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:04:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4228, Invalid=12802, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:04:18,102 INFO L87 Difference]: Start difference. First operand 628 states and 629 transitions. Second operand 131 states. [2018-10-15 15:04:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:27,377 INFO L93 Difference]: Finished difference Result 639 states and 640 transitions. [2018-10-15 15:04:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-15 15:04:27,378 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 627 [2018-10-15 15:04:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:27,379 INFO L225 Difference]: With dead ends: 639 [2018-10-15 15:04:27,379 INFO L226 Difference]: Without dead ends: 635 [2018-10-15 15:04:27,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=20492, Invalid=46330, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:04:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-10-15 15:04:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2018-10-15 15:04:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-10-15 15:04:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 634 transitions. [2018-10-15 15:04:27,386 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 634 transitions. Word has length 627 [2018-10-15 15:04:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:27,386 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 634 transitions. [2018-10-15 15:04:27,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:04:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 634 transitions. [2018-10-15 15:04:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-10-15 15:04:27,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:27,391 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:27,391 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:27,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2115168065, now seen corresponding path program 100 times [2018-10-15 15:04:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15610 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 10208 trivial. 0 not checked. [2018-10-15 15:04:29,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:29,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:04:29,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:04:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:04:29,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:04:29,274 INFO L87 Difference]: Start difference. First operand 633 states and 634 transitions. Second operand 77 states. [2018-10-15 15:04:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:32,639 INFO L93 Difference]: Finished difference Result 646 states and 647 transitions. [2018-10-15 15:04:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 15:04:32,639 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 632 [2018-10-15 15:04:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:32,640 INFO L225 Difference]: With dead ends: 646 [2018-10-15 15:04:32,641 INFO L226 Difference]: Without dead ends: 646 [2018-10-15 15:04:32,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:04:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-10-15 15:04:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 641. [2018-10-15 15:04:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-15 15:04:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 642 transitions. [2018-10-15 15:04:32,646 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 642 transitions. Word has length 632 [2018-10-15 15:04:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:32,646 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 642 transitions. [2018-10-15 15:04:32,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:04:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 642 transitions. [2018-10-15 15:04:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-15 15:04:32,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:32,649 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 39, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:32,649 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:32,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash -869415113, now seen corresponding path program 101 times [2018-10-15 15:04:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15908 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-15 15:04:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:37,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:04:37,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:04:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:04:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=13197, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:04:37,813 INFO L87 Difference]: Start difference. First operand 641 states and 642 transitions. Second operand 133 states. [2018-10-15 15:04:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:46,843 INFO L93 Difference]: Finished difference Result 652 states and 653 transitions. [2018-10-15 15:04:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 15:04:46,844 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 640 [2018-10-15 15:04:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:46,845 INFO L225 Difference]: With dead ends: 652 [2018-10-15 15:04:46,845 INFO L226 Difference]: Without dead ends: 648 [2018-10-15 15:04:46,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=21137, Invalid=47769, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 15:04:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-15 15:04:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2018-10-15 15:04:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-10-15 15:04:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 647 transitions. [2018-10-15 15:04:46,852 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 647 transitions. Word has length 640 [2018-10-15 15:04:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:46,852 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 647 transitions. [2018-10-15 15:04:46,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:04:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 647 transitions. [2018-10-15 15:04:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2018-10-15 15:04:46,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:46,856 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 39, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:46,856 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:46,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1701475450, now seen corresponding path program 102 times [2018-10-15 15:04:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16230 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 10530 trivial. 0 not checked. [2018-10-15 15:04:48,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:48,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:04:48,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:04:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:04:48,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:04:48,839 INFO L87 Difference]: Start difference. First operand 646 states and 647 transitions. Second operand 79 states. [2018-10-15 15:04:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:52,491 INFO L93 Difference]: Finished difference Result 659 states and 660 transitions. [2018-10-15 15:04:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 15:04:52,491 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 645 [2018-10-15 15:04:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:52,493 INFO L225 Difference]: With dead ends: 659 [2018-10-15 15:04:52,493 INFO L226 Difference]: Without dead ends: 659 [2018-10-15 15:04:52,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:04:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-15 15:04:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 654. [2018-10-15 15:04:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-15 15:04:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 655 transitions. [2018-10-15 15:04:52,498 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 655 transitions. Word has length 645 [2018-10-15 15:04:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:52,498 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 655 transitions. [2018-10-15 15:04:52,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:04:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 655 transitions. [2018-10-15 15:04:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-10-15 15:04:52,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:52,501 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:52,501 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:52,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1890470844, now seen corresponding path program 103 times [2018-10-15 15:04:52,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16536 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-15 15:04:57,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:57,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:04:57,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:04:57,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:04:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4492, Invalid=13598, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:04:57,910 INFO L87 Difference]: Start difference. First operand 654 states and 655 transitions. Second operand 135 states. [2018-10-15 15:05:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:07,696 INFO L93 Difference]: Finished difference Result 665 states and 666 transitions. [2018-10-15 15:05:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-15 15:05:07,697 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 653 [2018-10-15 15:05:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:07,698 INFO L225 Difference]: With dead ends: 665 [2018-10-15 15:05:07,698 INFO L226 Difference]: Without dead ends: 661 [2018-10-15 15:05:07,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=21792, Invalid=49230, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 15:05:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-10-15 15:05:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2018-10-15 15:05:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-15 15:05:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 660 transitions. [2018-10-15 15:05:07,704 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 660 transitions. Word has length 653 [2018-10-15 15:05:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:07,705 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 660 transitions. [2018-10-15 15:05:07,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:05:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 660 transitions. [2018-10-15 15:05:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-10-15 15:05:07,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:07,708 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:07,708 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:07,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1562269811, now seen corresponding path program 104 times [2018-10-15 15:05:07,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16863 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 6006 trivial. 0 not checked. [2018-10-15 15:05:13,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:13,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:05:13,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:05:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:05:13,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4627, Invalid=14005, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:05:13,180 INFO L87 Difference]: Start difference. First operand 659 states and 660 transitions. Second operand 137 states. [2018-10-15 15:05:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:23,031 INFO L93 Difference]: Finished difference Result 670 states and 671 transitions. [2018-10-15 15:05:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 15:05:23,031 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 658 [2018-10-15 15:05:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:23,032 INFO L225 Difference]: With dead ends: 670 [2018-10-15 15:05:23,032 INFO L226 Difference]: Without dead ends: 666 [2018-10-15 15:05:23,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22457, Invalid=50713, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 15:05:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-15 15:05:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2018-10-15 15:05:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-15 15:05:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 665 transitions. [2018-10-15 15:05:23,037 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 665 transitions. Word has length 658 [2018-10-15 15:05:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:23,037 INFO L481 AbstractCegarLoop]: Abstraction has 664 states and 665 transitions. [2018-10-15 15:05:23,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:05:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 665 transitions. [2018-10-15 15:05:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-10-15 15:05:23,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:23,040 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:23,040 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:23,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:23,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1763485212, now seen corresponding path program 105 times [2018-10-15 15:05:23,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 17195 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2018-10-15 15:05:25,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:25,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:05:25,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:05:25,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:05:25,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:05:25,079 INFO L87 Difference]: Start difference. First operand 664 states and 665 transitions. Second operand 81 states. [2018-10-15 15:05:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:28,735 INFO L93 Difference]: Finished difference Result 677 states and 678 transitions. [2018-10-15 15:05:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 15:05:28,735 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 663 [2018-10-15 15:05:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:28,736 INFO L225 Difference]: With dead ends: 677 [2018-10-15 15:05:28,737 INFO L226 Difference]: Without dead ends: 677 [2018-10-15 15:05:28,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 15:05:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-10-15 15:05:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 672. [2018-10-15 15:05:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-10-15 15:05:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 673 transitions. [2018-10-15 15:05:28,742 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 673 transitions. Word has length 663 [2018-10-15 15:05:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:28,742 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 673 transitions. [2018-10-15 15:05:28,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:05:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 673 transitions. [2018-10-15 15:05:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2018-10-15 15:05:28,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:28,745 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 41, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:28,745 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:28,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash -343278802, now seen corresponding path program 106 times [2018-10-15 15:05:28,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17509 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2018-10-15 15:05:30,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:30,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:05:30,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:05:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:05:30,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:05:30,879 INFO L87 Difference]: Start difference. First operand 672 states and 673 transitions. Second operand 83 states. [2018-10-15 15:05:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:34,916 INFO L93 Difference]: Finished difference Result 685 states and 686 transitions. [2018-10-15 15:05:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 15:05:34,917 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 671 [2018-10-15 15:05:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:34,918 INFO L225 Difference]: With dead ends: 685 [2018-10-15 15:05:34,918 INFO L226 Difference]: Without dead ends: 685 [2018-10-15 15:05:34,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:05:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-15 15:05:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 680. [2018-10-15 15:05:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 15:05:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 681 transitions. [2018-10-15 15:05:34,924 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 681 transitions. Word has length 671 [2018-10-15 15:05:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:34,925 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 681 transitions. [2018-10-15 15:05:34,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:05:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 681 transitions. [2018-10-15 15:05:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 15:05:34,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:34,929 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 42, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:34,929 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:34,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 533181048, now seen corresponding path program 107 times [2018-10-15 15:05:34,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 17831 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 11189 trivial. 0 not checked. [2018-10-15 15:05:37,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:37,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:05:37,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:05:37,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:05:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:05:37,255 INFO L87 Difference]: Start difference. First operand 680 states and 681 transitions. Second operand 85 states.