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/20181015-LoopsPathprograms/gr2006_true-unreach-call_true-termination.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:35:05,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:35:05,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:35:05,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:35:05,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:35:05,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:35:05,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:35:05,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:35:05,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:35:05,504 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:35:05,505 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:35:05,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:35:05,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:35:05,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:35:05,508 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:35:05,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:35:05,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:35:05,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:35:05,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:35:05,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:35:05,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:35:05,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:35:05,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:35:05,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:35:05,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:35:05,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:35:05,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:35:05,528 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:35:05,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:35:05,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:35:05,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:35:05,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:35:05,537 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:35:05,537 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:35:05,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:35:05,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:35:05,541 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 12:35:05,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:35:05,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:35:05,563 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:35:05,563 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:35:05,563 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:35:05,563 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:35:05,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:35:05,564 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:35:05,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:35:05,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:35:05,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:35:05,565 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:35:05,565 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:35:05,567 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:35:05,567 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:35:05,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:35:05,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:35:05,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:35:05,644 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:35:05,645 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:35:05,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/gr2006_true-unreach-call_true-termination.c.i_4.bpl [2018-10-15 12:35:05,646 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/gr2006_true-unreach-call_true-termination.c.i_4.bpl' [2018-10-15 12:35:05,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:35:05,706 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:35:05,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:35:05,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:35:05,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:35:05,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/1) ... [2018-10-15 12:35:05,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:35:05,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:35:05,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:35:05,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:35:05,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (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 12:35:05,838 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:35:05,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:35:05,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:35:06,153 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:35:06,154 INFO L202 PluginConnector]: Adding new model gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:35:06 BoogieIcfgContainer [2018-10-15 12:35:06,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:35:06,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:35:06,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:35:06,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:35:06,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:35:05" (1/2) ... [2018-10-15 12:35:06,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a005f97 and model type gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:35:06, skipping insertion in model container [2018-10-15 12:35:06,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gr2006_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:35:06" (2/2) ... [2018-10-15 12:35:06,163 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006_true-unreach-call_true-termination.c.i_4.bpl [2018-10-15 12:35:06,173 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:35:06,181 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:35:06,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:35:06,228 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:35:06,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:35:06,230 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:35:06,230 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:35:06,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:35:06,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:35:06,231 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:35:06,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:35:06,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:35:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-15 12:35:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:35:06,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:06,259 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:06,260 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:06,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash -537898097, now seen corresponding path program 1 times [2018-10-15 12:35:06,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:06,590 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 12:35:06,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:35:06,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 12:35:06,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:35:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:35:06,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:06,615 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2018-10-15 12:35:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:06,775 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-10-15 12:35:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:35:06,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-15 12:35:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:06,787 INFO L225 Difference]: With dead ends: 32 [2018-10-15 12:35:06,788 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 12:35:06,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:35:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 12:35:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-10-15 12:35:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-15 12:35:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-10-15 12:35:06,829 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-10-15 12:35:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:06,829 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-10-15 12:35:06,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:35:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-10-15 12:35:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:35:06,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:06,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:06,831 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:06,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1701135153, now seen corresponding path program 1 times [2018-10-15 12:35:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:06,868 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 12:35:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:35:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:35:06,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:35:06,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:35:06,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:35:06,872 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-10-15 12:35:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:06,924 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-10-15 12:35:06,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:35:06,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-15 12:35:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:06,926 INFO L225 Difference]: With dead ends: 31 [2018-10-15 12:35:06,927 INFO L226 Difference]: Without dead ends: 31 [2018-10-15 12:35:06,928 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 12:35:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-15 12:35:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-10-15 12:35:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 12:35:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-10-15 12:35:06,935 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2018-10-15 12:35:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:06,935 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-10-15 12:35:06,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:35:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-10-15 12:35:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:35:06,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:06,937 INFO L375 BasicCegarLoop]: trace histogram [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 12:35:06,937 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:06,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash -314756013, now seen corresponding path program 1 times [2018-10-15 12:35:06,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:07,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:07,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:35:07,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:35:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:35:07,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:07,072 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-10-15 12:35:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,368 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-10-15 12:35:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:35:07,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-15 12:35:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,370 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:35:07,370 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:35:07,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:35:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:35:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-10-15 12:35:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:35:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-15 12:35:07,376 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 24 [2018-10-15 12:35:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,377 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-15 12:35:07,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:35:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-15 12:35:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 12:35:07,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,379 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1061034025, now seen corresponding path program 2 times [2018-10-15 12:35:07,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:07,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:07,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:35:07,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:35:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:35:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:35:07,498 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 7 states. [2018-10-15 12:35:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,766 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-10-15 12:35:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:35:07,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-10-15 12:35:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,768 INFO L225 Difference]: With dead ends: 47 [2018-10-15 12:35:07,768 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 12:35:07,769 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 12:35:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 12:35:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-10-15 12:35:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:35:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-15 12:35:07,777 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 32 [2018-10-15 12:35:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,777 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-15 12:35:07,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:35:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-15 12:35:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:35:07,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,779 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,780 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash 489477979, now seen corresponding path program 3 times [2018-10-15 12:35:07,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:07,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:07,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:35:07,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:35:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:35:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:35:07,960 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 9 states. [2018-10-15 12:35:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:08,500 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-15 12:35:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:35:08,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-10-15 12:35:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:08,503 INFO L225 Difference]: With dead ends: 55 [2018-10-15 12:35:08,503 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 12:35:08,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:35:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 12:35:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-10-15 12:35:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:35:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-15 12:35:08,511 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2018-10-15 12:35:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:08,512 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-15 12:35:08,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:35:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-15 12:35:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 12:35:08,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:08,514 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:08,514 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:08,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:08,515 INFO L82 PathProgramCache]: Analyzing trace with hash -964558113, now seen corresponding path program 4 times [2018-10-15 12:35:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:08,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:08,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:35:08,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:35:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:35:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:35:08,713 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 11 states. [2018-10-15 12:35:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:09,158 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-10-15 12:35:09,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:35:09,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-10-15 12:35:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:09,160 INFO L225 Difference]: With dead ends: 63 [2018-10-15 12:35:09,160 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:35:09,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:35:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:35:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-10-15 12:35:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 12:35:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-10-15 12:35:09,177 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 48 [2018-10-15 12:35:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:09,178 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-10-15 12:35:09,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:35:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-10-15 12:35:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 12:35:09,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:09,184 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:09,184 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:09,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1019570787, now seen corresponding path program 5 times [2018-10-15 12:35:09,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 5 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:09,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:35:09,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:35:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:35:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:35:09,484 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 13 states. [2018-10-15 12:35:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:09,824 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-10-15 12:35:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:35:09,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-10-15 12:35:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:09,832 INFO L225 Difference]: With dead ends: 71 [2018-10-15 12:35:09,833 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 12:35:09,833 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 12:35:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 12:35:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-10-15 12:35:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:35:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-10-15 12:35:09,844 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 56 [2018-10-15 12:35:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:09,845 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-10-15 12:35:09,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:35:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-10-15 12:35:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:35:09,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:09,846 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:09,847 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:09,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1141174809, now seen corresponding path program 6 times [2018-10-15 12:35:09,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:10,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:35:10,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:35:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:35:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:35:10,095 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 15 states. [2018-10-15 12:35:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:10,420 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-10-15 12:35:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:35:10,420 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-10-15 12:35:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:10,422 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:35:10,423 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:35:10,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:35:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-10-15 12:35:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:35:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-10-15 12:35:10,431 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 64 [2018-10-15 12:35:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:10,431 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-10-15 12:35:10,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:35:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-10-15 12:35:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:35:10,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:10,433 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:10,433 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:10,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:10,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1009184107, now seen corresponding path program 7 times [2018-10-15 12:35:10,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 7 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:10,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:10,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:35:10,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:35:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:35:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:35:10,785 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 17 states. [2018-10-15 12:35:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:11,150 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-15 12:35:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:35:11,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-10-15 12:35:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:11,152 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:35:11,152 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 12:35:11,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 12:35:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-10-15 12:35:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:35:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-10-15 12:35:11,160 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 72 [2018-10-15 12:35:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:11,161 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-10-15 12:35:11,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:35:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-10-15 12:35:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 12:35:11,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:11,163 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:11,163 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:11,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1900873967, now seen corresponding path program 8 times [2018-10-15 12:35:11,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 8 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:11,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:11,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:35:11,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:35:11,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:35:11,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:35:11,472 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 19 states. [2018-10-15 12:35:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:12,096 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-10-15 12:35:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:35:12,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 80 [2018-10-15 12:35:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:12,098 INFO L225 Difference]: With dead ends: 95 [2018-10-15 12:35:12,098 INFO L226 Difference]: Without dead ends: 95 [2018-10-15 12:35:12,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-15 12:35:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-10-15 12:35:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 12:35:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-10-15 12:35:12,118 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 80 [2018-10-15 12:35:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:12,118 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-10-15 12:35:12,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:35:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-10-15 12:35:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:35:12,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:12,124 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:12,125 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:12,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash -881762189, now seen corresponding path program 9 times [2018-10-15 12:35:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 9 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:12,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:12,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:35:12,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:35:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:35:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:35:12,568 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 21 states. [2018-10-15 12:35:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:12,991 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-10-15 12:35:12,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:35:12,992 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-10-15 12:35:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:12,993 INFO L225 Difference]: With dead ends: 103 [2018-10-15 12:35:12,993 INFO L226 Difference]: Without dead ends: 103 [2018-10-15 12:35:12,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-15 12:35:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-10-15 12:35:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 12:35:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-15 12:35:13,001 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 88 [2018-10-15 12:35:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:13,001 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-15 12:35:13,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:35:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-10-15 12:35:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 12:35:13,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:13,003 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:13,003 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:13,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1989669879, now seen corresponding path program 10 times [2018-10-15 12:35:13,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:13,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:13,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:35:13,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:35:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:35:13,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:13,525 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 23 states. [2018-10-15 12:35:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:13,972 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-10-15 12:35:13,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:35:13,972 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2018-10-15 12:35:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:13,974 INFO L225 Difference]: With dead ends: 111 [2018-10-15 12:35:13,974 INFO L226 Difference]: Without dead ends: 111 [2018-10-15 12:35:13,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-15 12:35:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-10-15 12:35:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:35:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-10-15 12:35:13,981 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 96 [2018-10-15 12:35:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:13,981 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-10-15 12:35:13,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:35:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-10-15 12:35:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 12:35:13,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:13,983 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:13,983 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:13,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:13,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1522844539, now seen corresponding path program 11 times [2018-10-15 12:35:13,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 11 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:14,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:14,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:35:14,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:35:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:35:14,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:14,282 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 25 states. [2018-10-15 12:35:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:14,995 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-10-15 12:35:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:35:14,996 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 104 [2018-10-15 12:35:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:14,997 INFO L225 Difference]: With dead ends: 119 [2018-10-15 12:35:14,997 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 12:35:14,998 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 12:35:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 12:35:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2018-10-15 12:35:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 12:35:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-10-15 12:35:15,002 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 104 [2018-10-15 12:35:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:15,003 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-10-15 12:35:15,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:35:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-10-15 12:35:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:35:15,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:15,004 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:15,005 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:15,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash 469487359, now seen corresponding path program 12 times [2018-10-15 12:35:15,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 12 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:15,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:35:15,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:35:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:35:15,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:15,387 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 27 states. [2018-10-15 12:35:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:15,920 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-10-15 12:35:15,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:35:15,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 112 [2018-10-15 12:35:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:15,922 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:35:15,922 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:35:15,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:35:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:35:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2018-10-15 12:35:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:35:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-10-15 12:35:15,928 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 112 [2018-10-15 12:35:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:15,928 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-10-15 12:35:15,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:35:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-10-15 12:35:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:35:15,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:15,930 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:15,930 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:15,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash 440473219, now seen corresponding path program 13 times [2018-10-15 12:35:15,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 13 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:16,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:16,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:35:16,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:35:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:35:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:16,688 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 29 states. [2018-10-15 12:35:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:18,013 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-10-15 12:35:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:35:18,014 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 120 [2018-10-15 12:35:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:18,016 INFO L225 Difference]: With dead ends: 135 [2018-10-15 12:35:18,016 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:35:18,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:35:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:35:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-10-15 12:35:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 12:35:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-10-15 12:35:18,022 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 120 [2018-10-15 12:35:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:18,022 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-10-15 12:35:18,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:35:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-10-15 12:35:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:35:18,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:18,024 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:18,024 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:18,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1905826311, now seen corresponding path program 14 times [2018-10-15 12:35:18,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 14 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:19,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:19,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:35:19,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:35:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:35:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:19,073 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 31 states. [2018-10-15 12:35:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:19,762 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-10-15 12:35:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:35:19,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2018-10-15 12:35:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:19,764 INFO L225 Difference]: With dead ends: 143 [2018-10-15 12:35:19,764 INFO L226 Difference]: Without dead ends: 143 [2018-10-15 12:35:19,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:35:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-15 12:35:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-10-15 12:35:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:35:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-10-15 12:35:19,769 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 128 [2018-10-15 12:35:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:19,769 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-10-15 12:35:19,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:35:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-10-15 12:35:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:35:19,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:19,770 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:19,770 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:19,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash -100247157, now seen corresponding path program 15 times [2018-10-15 12:35:19,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 15 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:20,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:20,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:35:20,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:35:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:35:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:20,448 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 33 states. [2018-10-15 12:35:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:21,162 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2018-10-15 12:35:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:35:21,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-15 12:35:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:21,164 INFO L225 Difference]: With dead ends: 151 [2018-10-15 12:35:21,164 INFO L226 Difference]: Without dead ends: 151 [2018-10-15 12:35:21,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:35:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-15 12:35:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2018-10-15 12:35:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:35:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-15 12:35:21,170 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 136 [2018-10-15 12:35:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:21,170 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-15 12:35:21,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:35:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-15 12:35:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 12:35:21,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:21,171 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:21,172 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:21,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1200510223, now seen corresponding path program 16 times [2018-10-15 12:35:21,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 16 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:21,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:21,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:35:21,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:35:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:35:21,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:21,725 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 35 states. [2018-10-15 12:35:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:22,605 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-10-15 12:35:22,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:35:22,606 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 144 [2018-10-15 12:35:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:22,608 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:35:22,608 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:35:22,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:35:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:35:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2018-10-15 12:35:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 12:35:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-10-15 12:35:22,613 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 144 [2018-10-15 12:35:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:22,613 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-10-15 12:35:22,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:35:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-10-15 12:35:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 12:35:22,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:22,614 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:22,615 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:22,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1439396717, now seen corresponding path program 17 times [2018-10-15 12:35:22,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 17 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:23,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:23,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:35:23,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:35:23,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:35:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:35:23,141 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 37 states. [2018-10-15 12:35:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:24,322 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-10-15 12:35:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:35:24,322 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 152 [2018-10-15 12:35:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:24,323 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:35:24,323 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 12:35:24,325 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 12:35:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 12:35:24,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2018-10-15 12:35:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:35:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-10-15 12:35:24,329 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 152 [2018-10-15 12:35:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:24,329 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-10-15 12:35:24,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:35:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-10-15 12:35:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:35:24,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:24,330 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:24,330 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:24,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 771555351, now seen corresponding path program 18 times [2018-10-15 12:35:24,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 18 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:24,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:24,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:35:24,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:35:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:35:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:24,873 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 39 states. [2018-10-15 12:35:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:25,847 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2018-10-15 12:35:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:35:25,848 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 160 [2018-10-15 12:35:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:25,849 INFO L225 Difference]: With dead ends: 175 [2018-10-15 12:35:25,849 INFO L226 Difference]: Without dead ends: 175 [2018-10-15 12:35:25,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:35:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-15 12:35:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2018-10-15 12:35:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 12:35:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-10-15 12:35:25,855 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 160 [2018-10-15 12:35:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:25,855 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-10-15 12:35:25,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:35:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-10-15 12:35:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 12:35:25,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:25,856 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:25,857 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:25,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1695830117, now seen corresponding path program 19 times [2018-10-15 12:35:25,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 19 proven. 1387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:26,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:26,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:35:26,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:35:26,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:35:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:26,544 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 41 states. [2018-10-15 12:35:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:27,667 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-10-15 12:35:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:35:27,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 168 [2018-10-15 12:35:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:27,670 INFO L225 Difference]: With dead ends: 183 [2018-10-15 12:35:27,670 INFO L226 Difference]: Without dead ends: 183 [2018-10-15 12:35:27,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:35:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-15 12:35:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2018-10-15 12:35:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 12:35:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-10-15 12:35:27,677 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 168 [2018-10-15 12:35:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:27,677 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-10-15 12:35:27,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:35:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-10-15 12:35:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 12:35:27,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:27,679 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:27,679 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:27,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1963236127, now seen corresponding path program 20 times [2018-10-15 12:35:27,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 20 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:28,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:28,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:35:28,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:35:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:35:28,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:28,517 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 43 states. [2018-10-15 12:35:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:29,797 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-10-15 12:35:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:35:29,806 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 176 [2018-10-15 12:35:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:29,807 INFO L225 Difference]: With dead ends: 191 [2018-10-15 12:35:29,808 INFO L226 Difference]: Without dead ends: 191 [2018-10-15 12:35:29,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:35:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-15 12:35:29,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2018-10-15 12:35:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:35:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-10-15 12:35:29,815 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 176 [2018-10-15 12:35:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:29,815 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-10-15 12:35:29,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:35:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-10-15 12:35:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:35:29,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:29,816 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:29,817 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:29,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash -62143837, now seen corresponding path program 21 times [2018-10-15 12:35:29,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 21 proven. 1701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:30,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:30,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:35:30,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:35:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:35:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:35:30,699 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 45 states. [2018-10-15 12:35:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:32,009 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-10-15 12:35:32,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:35:32,010 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-10-15 12:35:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:32,012 INFO L225 Difference]: With dead ends: 199 [2018-10-15 12:35:32,012 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 12:35:32,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:35:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 12:35:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2018-10-15 12:35:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 12:35:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-10-15 12:35:32,016 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 184 [2018-10-15 12:35:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:32,017 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-10-15 12:35:32,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:35:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-10-15 12:35:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 12:35:32,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:32,018 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:32,018 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:32,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash 751117863, now seen corresponding path program 22 times [2018-10-15 12:35:32,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 22 proven. 1870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:32,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:35:32,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:35:32,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:35:32,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:35:32,758 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 47 states. [2018-10-15 12:35:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:34,488 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-10-15 12:35:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:35:34,489 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 192 [2018-10-15 12:35:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:34,490 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:35:34,491 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:35:34,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:35:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:35:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2018-10-15 12:35:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 12:35:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-10-15 12:35:34,496 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 192 [2018-10-15 12:35:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:34,497 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-10-15 12:35:34,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:35:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-10-15 12:35:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 12:35:34,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:34,498 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:34,499 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:34,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1099643477, now seen corresponding path program 23 times [2018-10-15 12:35:34,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 23 proven. 2047 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:35,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:35,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:35:35,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:35:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:35:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:35:35,329 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 49 states. [2018-10-15 12:35:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:36,767 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-15 12:35:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:35:36,767 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 200 [2018-10-15 12:35:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:36,769 INFO L225 Difference]: With dead ends: 215 [2018-10-15 12:35:36,770 INFO L226 Difference]: Without dead ends: 215 [2018-10-15 12:35:36,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:35:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-15 12:35:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2018-10-15 12:35:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 12:35:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-10-15 12:35:36,775 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 200 [2018-10-15 12:35:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:36,776 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-10-15 12:35:36,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:35:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-10-15 12:35:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 12:35:36,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:36,777 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:36,777 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:36,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash 626958639, now seen corresponding path program 24 times [2018-10-15 12:35:36,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 24 proven. 2232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:37,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:35:37,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:35:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:35:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:35:37,843 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 51 states. [2018-10-15 12:35:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:40,065 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-10-15 12:35:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:35:40,066 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 208 [2018-10-15 12:35:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:40,067 INFO L225 Difference]: With dead ends: 223 [2018-10-15 12:35:40,067 INFO L226 Difference]: Without dead ends: 223 [2018-10-15 12:35:40,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:35:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-15 12:35:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2018-10-15 12:35:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 12:35:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-10-15 12:35:40,073 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 208 [2018-10-15 12:35:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:40,074 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-10-15 12:35:40,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:35:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-10-15 12:35:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 12:35:40,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:40,075 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:40,076 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:40,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1853441869, now seen corresponding path program 25 times [2018-10-15 12:35:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 25 proven. 2425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:40,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:40,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:35:41,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:35:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:35:41,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:35:41,000 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 53 states. [2018-10-15 12:35:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:42,735 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2018-10-15 12:35:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:35:42,735 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 216 [2018-10-15 12:35:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:42,737 INFO L225 Difference]: With dead ends: 231 [2018-10-15 12:35:42,737 INFO L226 Difference]: Without dead ends: 231 [2018-10-15 12:35:42,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:35:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-15 12:35:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2018-10-15 12:35:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 12:35:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-10-15 12:35:42,742 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 216 [2018-10-15 12:35:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:42,743 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-10-15 12:35:42,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:35:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-10-15 12:35:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-15 12:35:42,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:42,745 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:42,745 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:42,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash -286192585, now seen corresponding path program 26 times [2018-10-15 12:35:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 26 proven. 2626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:44,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:44,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:35:44,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:35:44,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:35:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:35:44,544 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 55 states. [2018-10-15 12:35:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:46,791 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-10-15 12:35:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:35:46,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 224 [2018-10-15 12:35:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:46,793 INFO L225 Difference]: With dead ends: 239 [2018-10-15 12:35:46,793 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 12:35:46,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:35:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 12:35:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2018-10-15 12:35:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 12:35:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-10-15 12:35:46,799 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 224 [2018-10-15 12:35:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:46,800 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-10-15 12:35:46,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:35:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-10-15 12:35:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 12:35:46,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:46,801 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:46,802 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:46,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash -442393669, now seen corresponding path program 27 times [2018-10-15 12:35:46,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 27 proven. 2835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:47,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:47,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:35:47,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:35:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:35:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:35:47,987 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 57 states. [2018-10-15 12:35:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:50,102 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-10-15 12:35:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:35:50,103 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 232 [2018-10-15 12:35:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:50,105 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:35:50,105 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 12:35:50,109 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 12:35:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 12:35:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2018-10-15 12:35:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 12:35:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-10-15 12:35:50,114 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 232 [2018-10-15 12:35:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:50,115 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-10-15 12:35:50,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:35:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-10-15 12:35:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:35:50,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:50,116 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:50,117 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:50,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash -644061377, now seen corresponding path program 28 times [2018-10-15 12:35:50,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 28 proven. 3052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:51,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:51,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:35:51,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:35:51,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:35:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:35:51,611 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 59 states. [2018-10-15 12:35:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:53,531 INFO L93 Difference]: Finished difference Result 255 states and 256 transitions. [2018-10-15 12:35:53,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:35:53,532 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 240 [2018-10-15 12:35:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:53,533 INFO L225 Difference]: With dead ends: 255 [2018-10-15 12:35:53,533 INFO L226 Difference]: Without dead ends: 255 [2018-10-15 12:35:53,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:35:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-15 12:35:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2018-10-15 12:35:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 12:35:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-10-15 12:35:53,538 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 240 [2018-10-15 12:35:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:53,539 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-10-15 12:35:53,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:35:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-10-15 12:35:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 12:35:53,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:53,541 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:53,541 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:53,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash -354062653, now seen corresponding path program 29 times [2018-10-15 12:35:53,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 29 proven. 3277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:55,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:55,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:35:55,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:35:55,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:35:55,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:35:55,599 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 61 states. [2018-10-15 12:35:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:59,840 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2018-10-15 12:35:59,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:35:59,840 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 248 [2018-10-15 12:35:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:59,842 INFO L225 Difference]: With dead ends: 263 [2018-10-15 12:35:59,843 INFO L226 Difference]: Without dead ends: 263 [2018-10-15 12:35:59,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:35:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-15 12:35:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2018-10-15 12:35:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-15 12:35:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-10-15 12:35:59,849 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 248 [2018-10-15 12:35:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:59,849 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-10-15 12:35:59,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:35:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-10-15 12:35:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-15 12:35:59,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:59,851 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:59,851 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:59,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash -176115129, now seen corresponding path program 30 times [2018-10-15 12:35:59,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 30 proven. 3510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:01,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:01,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:36:01,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:36:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:36:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:36:01,382 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 63 states. [2018-10-15 12:36:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:03,525 INFO L93 Difference]: Finished difference Result 271 states and 272 transitions. [2018-10-15 12:36:03,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:36:03,525 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 256 [2018-10-15 12:36:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:03,527 INFO L225 Difference]: With dead ends: 271 [2018-10-15 12:36:03,527 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 12:36:03,528 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 12:36:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 12:36:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2018-10-15 12:36:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 12:36:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-10-15 12:36:03,532 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 256 [2018-10-15 12:36:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:03,533 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-10-15 12:36:03,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:36:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-10-15 12:36:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 12:36:03,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:03,535 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:03,535 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:03,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1854787125, now seen corresponding path program 31 times [2018-10-15 12:36:03,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 31 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:05,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:05,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:36:05,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:36:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:36:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:36:05,194 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 65 states. [2018-10-15 12:36:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:07,490 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-10-15 12:36:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:36:07,490 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 264 [2018-10-15 12:36:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:07,492 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:36:07,492 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:36:07,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:36:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:36:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2018-10-15 12:36:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 12:36:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-10-15 12:36:07,497 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 264 [2018-10-15 12:36:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:07,498 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-10-15 12:36:07,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:36:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-10-15 12:36:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 12:36:07,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:07,499 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:07,500 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:07,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 314436943, now seen corresponding path program 32 times [2018-10-15 12:36:07,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 32 proven. 4000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:08,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:08,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:36:08,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:36:08,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:36:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:36:08,831 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 67 states. [2018-10-15 12:36:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:11,632 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2018-10-15 12:36:11,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:36:11,633 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 272 [2018-10-15 12:36:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:11,634 INFO L225 Difference]: With dead ends: 287 [2018-10-15 12:36:11,635 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 12:36:11,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:36:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 12:36:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 281. [2018-10-15 12:36:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-15 12:36:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-10-15 12:36:11,639 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 272 [2018-10-15 12:36:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:11,640 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-10-15 12:36:11,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:36:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-10-15 12:36:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-15 12:36:11,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:11,641 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:11,641 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:11,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1989679917, now seen corresponding path program 33 times [2018-10-15 12:36:11,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 33 proven. 4257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:36:13,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:36:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:36:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:36:13,258 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 69 states. [2018-10-15 12:36:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:15,872 INFO L93 Difference]: Finished difference Result 295 states and 296 transitions. [2018-10-15 12:36:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:36:15,873 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 280 [2018-10-15 12:36:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:15,875 INFO L225 Difference]: With dead ends: 295 [2018-10-15 12:36:15,875 INFO L226 Difference]: Without dead ends: 295 [2018-10-15 12:36:15,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:36:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-15 12:36:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2018-10-15 12:36:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 12:36:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-10-15 12:36:15,880 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 280 [2018-10-15 12:36:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:15,880 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-10-15 12:36:15,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:36:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-10-15 12:36:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 12:36:15,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:15,882 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:15,883 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:15,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1049356201, now seen corresponding path program 34 times [2018-10-15 12:36:15,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 34 proven. 4522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:17,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:36:17,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:36:17,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:36:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:36:17,499 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 71 states. [2018-10-15 12:36:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:20,371 INFO L93 Difference]: Finished difference Result 303 states and 304 transitions. [2018-10-15 12:36:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:36:20,371 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 288 [2018-10-15 12:36:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:20,372 INFO L225 Difference]: With dead ends: 303 [2018-10-15 12:36:20,373 INFO L226 Difference]: Without dead ends: 303 [2018-10-15 12:36:20,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:36:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-15 12:36:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2018-10-15 12:36:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-15 12:36:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-10-15 12:36:20,379 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 288 [2018-10-15 12:36:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:20,379 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-10-15 12:36:20,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:36:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-10-15 12:36:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 12:36:20,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:20,381 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:20,381 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:20,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1122404315, now seen corresponding path program 35 times [2018-10-15 12:36:20,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 35 proven. 4795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:22,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:22,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:36:22,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:36:22,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:36:22,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:36:22,150 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 73 states. [2018-10-15 12:36:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:25,187 INFO L93 Difference]: Finished difference Result 311 states and 312 transitions. [2018-10-15 12:36:25,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:36:25,187 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 296 [2018-10-15 12:36:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:25,188 INFO L225 Difference]: With dead ends: 311 [2018-10-15 12:36:25,189 INFO L226 Difference]: Without dead ends: 311 [2018-10-15 12:36:25,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:36:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-15 12:36:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2018-10-15 12:36:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 12:36:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-10-15 12:36:25,193 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 296 [2018-10-15 12:36:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:25,193 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-10-15 12:36:25,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:36:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-10-15 12:36:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-15 12:36:25,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:25,195 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:25,195 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:25,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1371747167, now seen corresponding path program 36 times [2018-10-15 12:36:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 36 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:27,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:27,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:36:27,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:36:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:36:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:36:27,491 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 75 states. [2018-10-15 12:36:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:30,683 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-10-15 12:36:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:36:30,683 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 304 [2018-10-15 12:36:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:30,686 INFO L225 Difference]: With dead ends: 319 [2018-10-15 12:36:30,686 INFO L226 Difference]: Without dead ends: 319 [2018-10-15 12:36:30,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:36:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-15 12:36:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 313. [2018-10-15 12:36:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 12:36:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-10-15 12:36:30,691 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 304 [2018-10-15 12:36:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:30,692 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-10-15 12:36:30,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:36:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-10-15 12:36:30,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 12:36:30,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:30,694 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:30,694 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:30,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -301065501, now seen corresponding path program 37 times [2018-10-15 12:36:30,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 37 proven. 5365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:33,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:33,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:36:33,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:36:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:36:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:36:33,101 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 77 states. [2018-10-15 12:36:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:36,459 INFO L93 Difference]: Finished difference Result 327 states and 328 transitions. [2018-10-15 12:36:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:36:36,460 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 312 [2018-10-15 12:36:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:36,461 INFO L225 Difference]: With dead ends: 327 [2018-10-15 12:36:36,461 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 12:36:36,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:36:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 12:36:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 321. [2018-10-15 12:36:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-15 12:36:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-10-15 12:36:36,467 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 312 [2018-10-15 12:36:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:36,467 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-10-15 12:36:36,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:36:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-10-15 12:36:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-15 12:36:36,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:36,469 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:36,469 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:36,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash -741654937, now seen corresponding path program 38 times [2018-10-15 12:36:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 38 proven. 5662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:38,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:38,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:36:38,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:36:38,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:36:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:36:38,556 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 79 states. [2018-10-15 12:36:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:41,969 INFO L93 Difference]: Finished difference Result 335 states and 336 transitions. [2018-10-15 12:36:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:36:41,970 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 320 [2018-10-15 12:36:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:41,971 INFO L225 Difference]: With dead ends: 335 [2018-10-15 12:36:41,971 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 12:36:41,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:36:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 12:36:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2018-10-15 12:36:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-15 12:36:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-10-15 12:36:41,976 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 320 [2018-10-15 12:36:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:41,976 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-10-15 12:36:41,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:36:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-10-15 12:36:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-15 12:36:41,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:41,979 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:41,979 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:41,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2063506923, now seen corresponding path program 39 times [2018-10-15 12:36:41,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 39 proven. 5967 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:44,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:44,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:36:44,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:36:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:36:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:36:44,045 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 81 states. [2018-10-15 12:36:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:47,630 INFO L93 Difference]: Finished difference Result 343 states and 344 transitions. [2018-10-15 12:36:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:36:47,630 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 328 [2018-10-15 12:36:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:47,632 INFO L225 Difference]: With dead ends: 343 [2018-10-15 12:36:47,632 INFO L226 Difference]: Without dead ends: 343 [2018-10-15 12:36:47,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:36:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-15 12:36:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2018-10-15 12:36:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-15 12:36:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-10-15 12:36:47,637 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 328 [2018-10-15 12:36:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:47,637 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-10-15 12:36:47,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:36:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-10-15 12:36:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 12:36:47,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:47,638 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:47,639 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:47,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash 397162863, now seen corresponding path program 40 times [2018-10-15 12:36:47,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 40 proven. 6280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:36:50,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:36:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:36:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:36:50,267 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 83 states. [2018-10-15 12:36:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:53,994 INFO L93 Difference]: Finished difference Result 351 states and 352 transitions. [2018-10-15 12:36:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:36:53,995 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 336 [2018-10-15 12:36:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:53,996 INFO L225 Difference]: With dead ends: 351 [2018-10-15 12:36:53,996 INFO L226 Difference]: Without dead ends: 351 [2018-10-15 12:36:53,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:36:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-15 12:36:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2018-10-15 12:36:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-15 12:36:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-10-15 12:36:54,003 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 336 [2018-10-15 12:36:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:54,003 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-10-15 12:36:54,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:36:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-10-15 12:36:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-15 12:36:54,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:54,006 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:54,006 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:54,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1713893133, now seen corresponding path program 41 times [2018-10-15 12:36:54,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 41 proven. 6601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:36:56,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:56,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:36:56,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:36:56,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:36:56,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:36:56,371 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 85 states. [2018-10-15 12:36:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:59,989 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2018-10-15 12:36:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:36:59,989 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 344 [2018-10-15 12:36:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:59,991 INFO L225 Difference]: With dead ends: 359 [2018-10-15 12:36:59,991 INFO L226 Difference]: Without dead ends: 359 [2018-10-15 12:36:59,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:36:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-15 12:36:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 353. [2018-10-15 12:36:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 12:36:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-10-15 12:36:59,997 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 344 [2018-10-15 12:36:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:59,997 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-10-15 12:36:59,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:36:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-10-15 12:36:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 12:36:59,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:59,999 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:00,000 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:00,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1383717769, now seen corresponding path program 42 times [2018-10-15 12:37:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 42 proven. 6930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:02,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:02,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:37:02,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:37:02,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:37:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:37:02,398 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 87 states. [2018-10-15 12:37:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:06,759 INFO L93 Difference]: Finished difference Result 367 states and 368 transitions. [2018-10-15 12:37:06,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:37:06,759 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 352 [2018-10-15 12:37:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:06,761 INFO L225 Difference]: With dead ends: 367 [2018-10-15 12:37:06,761 INFO L226 Difference]: Without dead ends: 367 [2018-10-15 12:37:06,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:37:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-15 12:37:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 361. [2018-10-15 12:37:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-15 12:37:06,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-10-15 12:37:06,766 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 352 [2018-10-15 12:37:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:06,767 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-10-15 12:37:06,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:37:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-10-15 12:37:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-15 12:37:06,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:06,768 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:06,768 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:06,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1162185733, now seen corresponding path program 43 times [2018-10-15 12:37:06,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 43 proven. 7267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:09,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:09,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:37:09,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:37:09,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:37:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:37:09,034 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 89 states. [2018-10-15 12:37:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:13,216 INFO L93 Difference]: Finished difference Result 375 states and 376 transitions. [2018-10-15 12:37:13,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:37:13,217 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 360 [2018-10-15 12:37:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:13,219 INFO L225 Difference]: With dead ends: 375 [2018-10-15 12:37:13,219 INFO L226 Difference]: Without dead ends: 375 [2018-10-15 12:37:13,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:37:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-15 12:37:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 369. [2018-10-15 12:37:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-15 12:37:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-10-15 12:37:13,224 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 360 [2018-10-15 12:37:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:13,225 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-10-15 12:37:13,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:37:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-10-15 12:37:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-15 12:37:13,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:13,227 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:13,227 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:13,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash -445055105, now seen corresponding path program 44 times [2018-10-15 12:37:13,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 44 proven. 7612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:15,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:15,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:37:15,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:37:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:37:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:37:15,718 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 91 states. [2018-10-15 12:37:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:20,021 INFO L93 Difference]: Finished difference Result 383 states and 384 transitions. [2018-10-15 12:37:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:37:20,022 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 368 [2018-10-15 12:37:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:20,023 INFO L225 Difference]: With dead ends: 383 [2018-10-15 12:37:20,023 INFO L226 Difference]: Without dead ends: 383 [2018-10-15 12:37:20,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:37:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-15 12:37:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 377. [2018-10-15 12:37:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-15 12:37:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-10-15 12:37:20,028 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 368 [2018-10-15 12:37:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:20,028 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-10-15 12:37:20,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:37:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-10-15 12:37:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-15 12:37:20,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:20,031 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:20,031 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:20,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash 231065347, now seen corresponding path program 45 times [2018-10-15 12:37:20,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 45 proven. 7965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:22,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:22,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:37:22,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:37:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:37:22,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:37:22,822 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 93 states. [2018-10-15 12:37:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:27,246 INFO L93 Difference]: Finished difference Result 391 states and 392 transitions. [2018-10-15 12:37:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:37:27,247 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 376 [2018-10-15 12:37:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:27,249 INFO L225 Difference]: With dead ends: 391 [2018-10-15 12:37:27,249 INFO L226 Difference]: Without dead ends: 391 [2018-10-15 12:37:27,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:37:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-15 12:37:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2018-10-15 12:37:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 12:37:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 12:37:27,255 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 376 [2018-10-15 12:37:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:27,255 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 12:37:27,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:37:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 12:37:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-15 12:37:27,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:27,258 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:27,258 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:27,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:27,259 INFO L82 PathProgramCache]: Analyzing trace with hash -811283833, now seen corresponding path program 46 times [2018-10-15 12:37:27,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 46 proven. 8326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:29,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:29,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:37:29,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:37:29,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:37:29,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:37:29,891 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 95 states. [2018-10-15 12:37:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:34,982 INFO L93 Difference]: Finished difference Result 399 states and 400 transitions. [2018-10-15 12:37:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:37:34,982 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 384 [2018-10-15 12:37:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:34,984 INFO L225 Difference]: With dead ends: 399 [2018-10-15 12:37:34,984 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 12:37:34,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:37:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 12:37:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 393. [2018-10-15 12:37:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-15 12:37:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-10-15 12:37:34,990 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 384 [2018-10-15 12:37:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:34,990 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-10-15 12:37:34,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:37:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-10-15 12:37:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-15 12:37:34,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:34,993 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:34,993 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:34,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2095445493, now seen corresponding path program 47 times [2018-10-15 12:37:34,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 47 proven. 8695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:38,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:37:38,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:37:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:37:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:37:38,118 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 97 states. [2018-10-15 12:37:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:43,048 INFO L93 Difference]: Finished difference Result 407 states and 408 transitions. [2018-10-15 12:37:43,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:37:43,048 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 392 [2018-10-15 12:37:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:43,050 INFO L225 Difference]: With dead ends: 407 [2018-10-15 12:37:43,050 INFO L226 Difference]: Without dead ends: 407 [2018-10-15 12:37:43,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:37:43,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-15 12:37:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 401. [2018-10-15 12:37:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-15 12:37:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-10-15 12:37:43,054 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 392 [2018-10-15 12:37:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:43,055 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-10-15 12:37:43,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:37:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-10-15 12:37:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-15 12:37:43,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:43,057 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:43,057 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:43,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1009354127, now seen corresponding path program 48 times [2018-10-15 12:37:43,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 48 proven. 9072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:46,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:46,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:37:46,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:37:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:37:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:37:46,308 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 99 states. [2018-10-15 12:37:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:51,348 INFO L93 Difference]: Finished difference Result 415 states and 416 transitions. [2018-10-15 12:37:51,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:37:51,348 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 400 [2018-10-15 12:37:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:51,350 INFO L225 Difference]: With dead ends: 415 [2018-10-15 12:37:51,350 INFO L226 Difference]: Without dead ends: 415 [2018-10-15 12:37:51,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:37:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-15 12:37:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 409. [2018-10-15 12:37:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-15 12:37:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-10-15 12:37:51,357 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 400 [2018-10-15 12:37:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:51,358 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-10-15 12:37:51,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:37:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-10-15 12:37:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-15 12:37:51,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:51,360 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:51,361 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:51,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:51,361 INFO L82 PathProgramCache]: Analyzing trace with hash -891863789, now seen corresponding path program 49 times [2018-10-15 12:37:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 49 proven. 9457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:54,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:54,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:37:54,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:37:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:37:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:37:54,524 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 101 states. [2018-10-15 12:37:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:59,708 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-10-15 12:37:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:37:59,709 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 408 [2018-10-15 12:37:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:59,712 INFO L225 Difference]: With dead ends: 419 [2018-10-15 12:37:59,712 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 12:37:59,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:37:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 12:37:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-10-15 12:37:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-15 12:37:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-10-15 12:37:59,717 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 408 [2018-10-15 12:37:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:59,718 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-10-15 12:37:59,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:37:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-10-15 12:37:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-15 12:37:59,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:59,720 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:59,720 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:59,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1155059561, now seen corresponding path program 50 times [2018-10-15 12:37:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 1015 proven. 1 refuted. 0 times theorem prover too weak. 8884 trivial. 0 not checked. [2018-10-15 12:37:59,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:59,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:37:59,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:37:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:37:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:37:59,899 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 8 states. [2018-10-15 12:38:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:00,057 INFO L93 Difference]: Finished difference Result 437 states and 440 transitions. [2018-10-15 12:38:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:38:00,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 416 [2018-10-15 12:38:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:00,060 INFO L225 Difference]: With dead ends: 437 [2018-10-15 12:38:00,060 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 12:38:00,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:38:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 12:38:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 432. [2018-10-15 12:38:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-15 12:38:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 435 transitions. [2018-10-15 12:38:00,065 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 435 transitions. Word has length 416 [2018-10-15 12:38:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:00,065 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 435 transitions. [2018-10-15 12:38:00,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:38:00,065 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 435 transitions. [2018-10-15 12:38:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-15 12:38:00,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:00,067 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 50, 50, 50, 50, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:00,068 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:00,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash -395671205, now seen corresponding path program 51 times [2018-10-15 12:38:00,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10155 backedges. 1256 proven. 11 refuted. 0 times theorem prover too weak. 8888 trivial. 0 not checked. [2018-10-15 12:38:00,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:00,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:38:00,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:38:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:38:00,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:38:00,635 INFO L87 Difference]: Start difference. First operand 432 states and 435 transitions. Second operand 9 states. [2018-10-15 12:38:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:00,762 INFO L93 Difference]: Finished difference Result 438 states and 441 transitions. [2018-10-15 12:38:00,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:38:00,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 424 [2018-10-15 12:38:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:00,767 INFO L225 Difference]: With dead ends: 438 [2018-10-15 12:38:00,767 INFO L226 Difference]: Without dead ends: 438 [2018-10-15 12:38:00,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:38:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-15 12:38:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2018-10-15 12:38:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-15 12:38:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 439 transitions. [2018-10-15 12:38:00,772 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 439 transitions. Word has length 424 [2018-10-15 12:38:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:00,772 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 439 transitions. [2018-10-15 12:38:00,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:38:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 439 transitions. [2018-10-15 12:38:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-15 12:38:00,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:00,775 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 50, 50, 50, 50, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:00,775 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:00,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash 758832671, now seen corresponding path program 52 times [2018-10-15 12:38:00,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10418 backedges. 6498 proven. 34 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2018-10-15 12:38:01,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:01,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:38:01,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:38:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:38:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=1314, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:38:01,866 INFO L87 Difference]: Start difference. First operand 436 states and 439 transitions. Second operand 42 states. [2018-10-15 12:38:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:03,229 INFO L93 Difference]: Finished difference Result 663 states and 689 transitions. [2018-10-15 12:38:03,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:38:03,230 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 432 [2018-10-15 12:38:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:03,236 INFO L225 Difference]: With dead ends: 663 [2018-10-15 12:38:03,236 INFO L226 Difference]: Without dead ends: 663 [2018-10-15 12:38:03,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1956, Invalid=5016, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:38:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-15 12:38:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 607. [2018-10-15 12:38:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-15 12:38:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 631 transitions. [2018-10-15 12:38:03,251 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 631 transitions. Word has length 432 [2018-10-15 12:38:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:03,252 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 631 transitions. [2018-10-15 12:38:03,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:38:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 631 transitions. [2018-10-15 12:38:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-15 12:38:03,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:03,255 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 50, 50, 50, 50, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:03,255 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:03,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1696846109, now seen corresponding path program 53 times [2018-10-15 12:38:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10689 backedges. 6728 proven. 70 refuted. 0 times theorem prover too weak. 3891 trivial. 0 not checked. [2018-10-15 12:38:04,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:04,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:38:04,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:38:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:38:04,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:38:04,655 INFO L87 Difference]: Start difference. First operand 607 states and 631 transitions. Second operand 43 states. [2018-10-15 12:38:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:06,204 INFO L93 Difference]: Finished difference Result 950 states and 1010 transitions. [2018-10-15 12:38:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:38:06,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 440 [2018-10-15 12:38:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:06,210 INFO L225 Difference]: With dead ends: 950 [2018-10-15 12:38:06,210 INFO L226 Difference]: Without dead ends: 950 [2018-10-15 12:38:06,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2017, Invalid=5465, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:38:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-10-15 12:38:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 610. [2018-10-15 12:38:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-15 12:38:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 634 transitions. [2018-10-15 12:38:06,223 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 634 transitions. Word has length 440 [2018-10-15 12:38:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:06,223 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 634 transitions. [2018-10-15 12:38:06,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:38:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 634 transitions. [2018-10-15 12:38:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-15 12:38:06,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:06,226 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 50, 50, 50, 50, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:06,226 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:06,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1097696345, now seen corresponding path program 54 times [2018-10-15 12:38:06,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10968 backedges. 6953 proven. 119 refuted. 0 times theorem prover too weak. 3896 trivial. 0 not checked. [2018-10-15 12:38:07,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:07,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:38:07,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:38:07,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:38:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:38:07,038 INFO L87 Difference]: Start difference. First operand 610 states and 634 transitions. Second operand 44 states. [2018-10-15 12:38:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:08,554 INFO L93 Difference]: Finished difference Result 1045 states and 1115 transitions. [2018-10-15 12:38:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:38:08,554 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 448 [2018-10-15 12:38:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:08,560 INFO L225 Difference]: With dead ends: 1045 [2018-10-15 12:38:08,560 INFO L226 Difference]: Without dead ends: 1045 [2018-10-15 12:38:08,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2083, Invalid=5927, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:38:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-10-15 12:38:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 613. [2018-10-15 12:38:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-10-15 12:38:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 637 transitions. [2018-10-15 12:38:08,572 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 637 transitions. Word has length 448 [2018-10-15 12:38:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:08,573 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 637 transitions. [2018-10-15 12:38:08,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:38:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 637 transitions. [2018-10-15 12:38:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-15 12:38:08,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:08,576 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 50, 50, 50, 50, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:08,576 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:08,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1583233941, now seen corresponding path program 55 times [2018-10-15 12:38:08,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11255 backedges. 7173 proven. 181 refuted. 0 times theorem prover too weak. 3901 trivial. 0 not checked. [2018-10-15 12:38:09,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:09,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:38:09,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:38:09,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:38:09,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1554, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:38:09,389 INFO L87 Difference]: Start difference. First operand 613 states and 637 transitions. Second operand 45 states. [2018-10-15 12:38:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:10,739 INFO L93 Difference]: Finished difference Result 1159 states and 1241 transitions. [2018-10-15 12:38:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:38:10,740 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 456 [2018-10-15 12:38:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:10,745 INFO L225 Difference]: With dead ends: 1159 [2018-10-15 12:38:10,745 INFO L226 Difference]: Without dead ends: 1159 [2018-10-15 12:38:10,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2154, Invalid=6402, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:38:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-10-15 12:38:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 616. [2018-10-15 12:38:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-15 12:38:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 640 transitions. [2018-10-15 12:38:10,757 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 640 transitions. Word has length 456 [2018-10-15 12:38:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:10,758 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 640 transitions. [2018-10-15 12:38:10,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:38:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 640 transitions. [2018-10-15 12:38:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-15 12:38:10,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:10,761 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 50, 50, 50, 50, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:10,761 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:10,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash -917632721, now seen corresponding path program 56 times [2018-10-15 12:38:10,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11550 backedges. 7388 proven. 256 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2018-10-15 12:38:11,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:11,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:38:11,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:38:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:38:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1636, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:38:11,793 INFO L87 Difference]: Start difference. First operand 616 states and 640 transitions. Second operand 46 states. [2018-10-15 12:38:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:13,392 INFO L93 Difference]: Finished difference Result 1292 states and 1388 transitions. [2018-10-15 12:38:13,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:38:13,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 464 [2018-10-15 12:38:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:13,399 INFO L225 Difference]: With dead ends: 1292 [2018-10-15 12:38:13,399 INFO L226 Difference]: Without dead ends: 1292 [2018-10-15 12:38:13,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2230, Invalid=6890, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:38:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2018-10-15 12:38:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 619. [2018-10-15 12:38:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-15 12:38:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 643 transitions. [2018-10-15 12:38:13,411 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 643 transitions. Word has length 464 [2018-10-15 12:38:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:13,412 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 643 transitions. [2018-10-15 12:38:13,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:38:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 643 transitions. [2018-10-15 12:38:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-15 12:38:13,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:13,414 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 50, 50, 50, 50, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:13,415 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:13,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 920340979, now seen corresponding path program 57 times [2018-10-15 12:38:13,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11853 backedges. 7598 proven. 344 refuted. 0 times theorem prover too weak. 3911 trivial. 0 not checked. [2018-10-15 12:38:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:14,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:38:14,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:38:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:38:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1719, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:38:14,278 INFO L87 Difference]: Start difference. First operand 619 states and 643 transitions. Second operand 47 states. [2018-10-15 12:38:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:15,595 INFO L93 Difference]: Finished difference Result 1444 states and 1556 transitions. [2018-10-15 12:38:15,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:38:15,595 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 472 [2018-10-15 12:38:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:15,601 INFO L225 Difference]: With dead ends: 1444 [2018-10-15 12:38:15,601 INFO L226 Difference]: Without dead ends: 1444 [2018-10-15 12:38:15,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2311, Invalid=7391, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:38:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2018-10-15 12:38:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 622. [2018-10-15 12:38:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-10-15 12:38:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 646 transitions. [2018-10-15 12:38:15,613 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 646 transitions. Word has length 472 [2018-10-15 12:38:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:15,613 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 646 transitions. [2018-10-15 12:38:15,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:38:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 646 transitions. [2018-10-15 12:38:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-10-15 12:38:15,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:15,616 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 50, 50, 50, 50, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:15,617 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:15,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1737328311, now seen corresponding path program 58 times [2018-10-15 12:38:15,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12164 backedges. 7803 proven. 445 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-10-15 12:38:16,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:16,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:38:16,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:38:16,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:38:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1803, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:38:16,494 INFO L87 Difference]: Start difference. First operand 622 states and 646 transitions. Second operand 48 states. [2018-10-15 12:38:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:18,211 INFO L93 Difference]: Finished difference Result 1615 states and 1745 transitions. [2018-10-15 12:38:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:38:18,211 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 480 [2018-10-15 12:38:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:18,216 INFO L225 Difference]: With dead ends: 1615 [2018-10-15 12:38:18,216 INFO L226 Difference]: Without dead ends: 1615 [2018-10-15 12:38:18,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2397, Invalid=7905, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:38:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2018-10-15 12:38:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 625. [2018-10-15 12:38:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-10-15 12:38:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 649 transitions. [2018-10-15 12:38:18,227 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 649 transitions. Word has length 480 [2018-10-15 12:38:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:18,227 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 649 transitions. [2018-10-15 12:38:18,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:38:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 649 transitions. [2018-10-15 12:38:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-15 12:38:18,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:18,230 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 50, 50, 50, 50, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:18,230 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:18,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1420345211, now seen corresponding path program 59 times [2018-10-15 12:38:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12483 backedges. 8003 proven. 559 refuted. 0 times theorem prover too weak. 3921 trivial. 0 not checked. [2018-10-15 12:38:19,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:19,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:38:19,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:38:19,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:38:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1888, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:38:19,090 INFO L87 Difference]: Start difference. First operand 625 states and 649 transitions. Second operand 49 states. [2018-10-15 12:38:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:20,680 INFO L93 Difference]: Finished difference Result 1803 states and 1953 transitions. [2018-10-15 12:38:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:38:20,681 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 488 [2018-10-15 12:38:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:20,686 INFO L225 Difference]: With dead ends: 1803 [2018-10-15 12:38:20,686 INFO L226 Difference]: Without dead ends: 1803 [2018-10-15 12:38:20,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2488, Invalid=8432, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:38:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-10-15 12:38:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 628. [2018-10-15 12:38:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-15 12:38:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 652 transitions. [2018-10-15 12:38:20,695 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 652 transitions. Word has length 488 [2018-10-15 12:38:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:20,695 INFO L481 AbstractCegarLoop]: Abstraction has 628 states and 652 transitions. [2018-10-15 12:38:20,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:38:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 652 transitions. [2018-10-15 12:38:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-15 12:38:20,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:20,697 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 50, 50, 50, 50, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:20,697 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:20,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1936782399, now seen corresponding path program 60 times [2018-10-15 12:38:20,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12810 backedges. 8198 proven. 686 refuted. 0 times theorem prover too weak. 3926 trivial. 0 not checked. [2018-10-15 12:38:21,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:21,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:38:21,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:38:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:38:21,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=1974, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:38:21,787 INFO L87 Difference]: Start difference. First operand 628 states and 652 transitions. Second operand 50 states. [2018-10-15 12:38:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:23,502 INFO L93 Difference]: Finished difference Result 2016 states and 2189 transitions. [2018-10-15 12:38:23,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:38:23,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 496 [2018-10-15 12:38:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:23,510 INFO L225 Difference]: With dead ends: 2016 [2018-10-15 12:38:23,510 INFO L226 Difference]: Without dead ends: 2016 [2018-10-15 12:38:23,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2749 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2584, Invalid=8972, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:38:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2018-10-15 12:38:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 631. [2018-10-15 12:38:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-15 12:38:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 655 transitions. [2018-10-15 12:38:23,519 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 655 transitions. Word has length 496 [2018-10-15 12:38:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:23,520 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 655 transitions. [2018-10-15 12:38:23,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:38:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 655 transitions. [2018-10-15 12:38:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-15 12:38:23,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:23,522 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 50, 50, 50, 50, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:23,522 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:23,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1255529213, now seen corresponding path program 61 times [2018-10-15 12:38:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13145 backedges. 8388 proven. 826 refuted. 0 times theorem prover too weak. 3931 trivial. 0 not checked. [2018-10-15 12:38:24,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:24,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:38:24,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:38:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:38:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=2061, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:38:24,726 INFO L87 Difference]: Start difference. First operand 631 states and 655 transitions. Second operand 51 states. [2018-10-15 12:38:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:26,394 INFO L93 Difference]: Finished difference Result 2216 states and 2410 transitions. [2018-10-15 12:38:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:38:26,394 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 504 [2018-10-15 12:38:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:26,400 INFO L225 Difference]: With dead ends: 2216 [2018-10-15 12:38:26,400 INFO L226 Difference]: Without dead ends: 2216 [2018-10-15 12:38:26,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2956 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2685, Invalid=9525, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:38:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2018-10-15 12:38:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 634. [2018-10-15 12:38:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-15 12:38:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 658 transitions. [2018-10-15 12:38:26,411 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 658 transitions. Word has length 504 [2018-10-15 12:38:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:26,411 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 658 transitions. [2018-10-15 12:38:26,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:38:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 658 transitions. [2018-10-15 12:38:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-15 12:38:26,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:26,413 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 50, 50, 50, 50, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:26,414 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:26,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2028449337, now seen corresponding path program 62 times [2018-10-15 12:38:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13488 backedges. 8573 proven. 979 refuted. 0 times theorem prover too weak. 3936 trivial. 0 not checked. [2018-10-15 12:38:27,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:27,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:38:27,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:38:27,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:38:27,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=2149, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:38:27,371 INFO L87 Difference]: Start difference. First operand 634 states and 658 transitions. Second operand 52 states. [2018-10-15 12:38:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:29,330 INFO L93 Difference]: Finished difference Result 2403 states and 2616 transitions. [2018-10-15 12:38:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:38:29,331 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 512 [2018-10-15 12:38:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:29,337 INFO L225 Difference]: With dead ends: 2403 [2018-10-15 12:38:29,337 INFO L226 Difference]: Without dead ends: 2403 [2018-10-15 12:38:29,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2791, Invalid=10091, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:38:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2018-10-15 12:38:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 637. [2018-10-15 12:38:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-10-15 12:38:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 661 transitions. [2018-10-15 12:38:29,348 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 661 transitions. Word has length 512 [2018-10-15 12:38:29,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:29,348 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 661 transitions. [2018-10-15 12:38:29,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:38:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 661 transitions. [2018-10-15 12:38:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-15 12:38:29,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:29,351 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 50, 50, 50, 50, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:29,352 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:29,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -763397493, now seen corresponding path program 63 times [2018-10-15 12:38:29,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13839 backedges. 8753 proven. 1145 refuted. 0 times theorem prover too weak. 3941 trivial. 0 not checked. [2018-10-15 12:38:30,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:30,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:38:30,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:38:30,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:38:30,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=2238, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:38:30,397 INFO L87 Difference]: Start difference. First operand 637 states and 661 transitions. Second operand 53 states. [2018-10-15 12:38:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:32,426 INFO L93 Difference]: Finished difference Result 2577 states and 2807 transitions. [2018-10-15 12:38:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:38:32,426 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 520 [2018-10-15 12:38:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:32,435 INFO L225 Difference]: With dead ends: 2577 [2018-10-15 12:38:32,435 INFO L226 Difference]: Without dead ends: 2577 [2018-10-15 12:38:32,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3388 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2902, Invalid=10670, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:38:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2018-10-15 12:38:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 640. [2018-10-15 12:38:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-15 12:38:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 664 transitions. [2018-10-15 12:38:32,448 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 664 transitions. Word has length 520 [2018-10-15 12:38:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:32,448 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 664 transitions. [2018-10-15 12:38:32,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:38:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 664 transitions. [2018-10-15 12:38:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-15 12:38:32,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:32,451 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 50, 50, 50, 50, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:32,451 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:32,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -56385713, now seen corresponding path program 64 times [2018-10-15 12:38:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14198 backedges. 12803 proven. 1324 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-15 12:38:36,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:36,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 12:38:36,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 12:38:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 12:38:36,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2838, Invalid=10968, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:38:36,606 INFO L87 Difference]: Start difference. First operand 640 states and 664 transitions. Second operand 118 states. [2018-10-15 12:38:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:43,390 INFO L93 Difference]: Finished difference Result 5473 states and 5988 transitions. [2018-10-15 12:38:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 12:38:43,390 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 528 [2018-10-15 12:38:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:43,401 INFO L225 Difference]: With dead ends: 5473 [2018-10-15 12:38:43,401 INFO L226 Difference]: Without dead ends: 5473 [2018-10-15 12:38:43,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13789 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15178, Invalid=46078, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 12:38:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2018-10-15 12:38:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 2941. [2018-10-15 12:38:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2941 states. [2018-10-15 12:38:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3223 transitions. [2018-10-15 12:38:43,447 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3223 transitions. Word has length 528 [2018-10-15 12:38:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:43,447 INFO L481 AbstractCegarLoop]: Abstraction has 2941 states and 3223 transitions. [2018-10-15 12:38:43,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 12:38:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3223 transitions. [2018-10-15 12:38:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-10-15 12:38:43,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:43,450 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 50, 50, 50, 50, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:43,450 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:43,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -423051245, now seen corresponding path program 65 times [2018-10-15 12:38:43,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14565 backedges. 12973 proven. 1516 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-15 12:38:47,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:47,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:38:47,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:38:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:38:47,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2855, Invalid=11187, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:38:47,515 INFO L87 Difference]: Start difference. First operand 2941 states and 3223 transitions. Second operand 119 states. [2018-10-15 12:38:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:54,194 INFO L93 Difference]: Finished difference Result 18170 states and 20245 transitions. [2018-10-15 12:38:54,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 12:38:54,202 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 536 [2018-10-15 12:38:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:54,242 INFO L225 Difference]: With dead ends: 18170 [2018-10-15 12:38:54,242 INFO L226 Difference]: Without dead ends: 18170 [2018-10-15 12:38:54,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14276 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=15363, Invalid=47387, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 12:38:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18170 states. [2018-10-15 12:38:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18170 to 2944. [2018-10-15 12:38:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2018-10-15 12:38:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3226 transitions. [2018-10-15 12:38:54,365 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3226 transitions. Word has length 536 [2018-10-15 12:38:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:54,365 INFO L481 AbstractCegarLoop]: Abstraction has 2944 states and 3226 transitions. [2018-10-15 12:38:54,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:38:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3226 transitions. [2018-10-15 12:38:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-10-15 12:38:54,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:54,369 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 50, 50, 50, 50, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:54,369 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:54,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash -298656553, now seen corresponding path program 66 times [2018-10-15 12:38:54,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14940 backedges. 13138 proven. 1721 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-15 12:38:58,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:58,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-10-15 12:38:58,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-15 12:38:58,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-15 12:38:58,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2873, Invalid=11407, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 12:38:58,468 INFO L87 Difference]: Start difference. First operand 2944 states and 3226 transitions. Second operand 120 states. [2018-10-15 12:39:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:04,935 INFO L93 Difference]: Finished difference Result 19479 states and 21711 transitions. [2018-10-15 12:39:04,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 12:39:04,935 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 544 [2018-10-15 12:39:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:04,960 INFO L225 Difference]: With dead ends: 19479 [2018-10-15 12:39:04,960 INFO L226 Difference]: Without dead ends: 19479 [2018-10-15 12:39:04,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14769 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=15553, Invalid=48709, Unknown=0, NotChecked=0, Total=64262 [2018-10-15 12:39:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19479 states. [2018-10-15 12:39:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19479 to 2947. [2018-10-15 12:39:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2018-10-15 12:39:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 3229 transitions. [2018-10-15 12:39:05,085 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 3229 transitions. Word has length 544 [2018-10-15 12:39:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:05,086 INFO L481 AbstractCegarLoop]: Abstraction has 2947 states and 3229 transitions. [2018-10-15 12:39:05,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-15 12:39:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3229 transitions. [2018-10-15 12:39:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-10-15 12:39:05,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:05,090 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 50, 50, 50, 50, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:05,090 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:05,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash -333056613, now seen corresponding path program 67 times [2018-10-15 12:39:05,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15323 backedges. 13298 proven. 1939 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-15 12:39:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:39:09,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:39:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:39:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2892, Invalid=11628, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:39:09,684 INFO L87 Difference]: Start difference. First operand 2947 states and 3229 transitions. Second operand 121 states. [2018-10-15 12:39:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:16,359 INFO L93 Difference]: Finished difference Result 20813 states and 23205 transitions. [2018-10-15 12:39:16,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 12:39:16,359 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 552 [2018-10-15 12:39:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:16,377 INFO L225 Difference]: With dead ends: 20813 [2018-10-15 12:39:16,377 INFO L226 Difference]: Without dead ends: 20813 [2018-10-15 12:39:16,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15748, Invalid=50044, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 12:39:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20813 states. [2018-10-15 12:39:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20813 to 2950. [2018-10-15 12:39:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2018-10-15 12:39:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3232 transitions. [2018-10-15 12:39:16,501 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3232 transitions. Word has length 552 [2018-10-15 12:39:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:16,502 INFO L481 AbstractCegarLoop]: Abstraction has 2950 states and 3232 transitions. [2018-10-15 12:39:16,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:39:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3232 transitions. [2018-10-15 12:39:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-10-15 12:39:16,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:16,506 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 50, 50, 50, 50, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:16,506 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:16,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 904268383, now seen corresponding path program 68 times [2018-10-15 12:39:16,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15714 backedges. 13453 proven. 2170 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-15 12:39:21,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:21,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 12:39:21,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 12:39:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 12:39:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=11850, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 12:39:21,015 INFO L87 Difference]: Start difference. First operand 2950 states and 3232 transitions. Second operand 122 states. [2018-10-15 12:39:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:28,029 INFO L93 Difference]: Finished difference Result 22166 states and 24720 transitions. [2018-10-15 12:39:28,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 12:39:28,029 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 560 [2018-10-15 12:39:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:28,045 INFO L225 Difference]: With dead ends: 22166 [2018-10-15 12:39:28,045 INFO L226 Difference]: Without dead ends: 22166 [2018-10-15 12:39:28,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15773 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=15948, Invalid=51392, Unknown=0, NotChecked=0, Total=67340 [2018-10-15 12:39:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22166 states. [2018-10-15 12:39:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22166 to 2953. [2018-10-15 12:39:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-10-15 12:39:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3235 transitions. [2018-10-15 12:39:28,144 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3235 transitions. Word has length 560 [2018-10-15 12:39:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:28,145 INFO L481 AbstractCegarLoop]: Abstraction has 2953 states and 3235 transitions. [2018-10-15 12:39:28,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 12:39:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3235 transitions. [2018-10-15 12:39:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-15 12:39:28,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:28,148 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 50, 50, 50, 50, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:28,148 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:28,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1665721565, now seen corresponding path program 69 times [2018-10-15 12:39:28,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16113 backedges. 13603 proven. 2414 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-15 12:39:32,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:32,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:39:32,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:39:32,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:39:32,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2933, Invalid=12073, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:39:32,645 INFO L87 Difference]: Start difference. First operand 2953 states and 3235 transitions. Second operand 123 states. [2018-10-15 12:39:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:39,787 INFO L93 Difference]: Finished difference Result 23538 states and 26256 transitions. [2018-10-15 12:39:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 12:39:39,787 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 568 [2018-10-15 12:39:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:39,808 INFO L225 Difference]: With dead ends: 23538 [2018-10-15 12:39:39,808 INFO L226 Difference]: Without dead ends: 23538 [2018-10-15 12:39:39,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16284 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=16153, Invalid=52753, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:39:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23538 states. [2018-10-15 12:39:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23538 to 2956. [2018-10-15 12:39:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2018-10-15 12:39:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3238 transitions. [2018-10-15 12:39:39,917 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3238 transitions. Word has length 568 [2018-10-15 12:39:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:39,917 INFO L481 AbstractCegarLoop]: Abstraction has 2956 states and 3238 transitions. [2018-10-15 12:39:39,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:39:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3238 transitions. [2018-10-15 12:39:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-10-15 12:39:39,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:39,920 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 50, 50, 50, 50, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:39,920 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:39,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1843210215, now seen corresponding path program 70 times [2018-10-15 12:39:39,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16520 backedges. 13748 proven. 2671 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-10-15 12:39:44,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:44,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-10-15 12:39:44,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-15 12:39:44,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-15 12:39:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2955, Invalid=12297, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 12:39:44,282 INFO L87 Difference]: Start difference. First operand 2956 states and 3238 transitions. Second operand 124 states. [2018-10-15 12:39:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:51,602 INFO L93 Difference]: Finished difference Result 24929 states and 27813 transitions. [2018-10-15 12:39:51,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 12:39:51,602 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 576 [2018-10-15 12:39:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:51,623 INFO L225 Difference]: With dead ends: 24929 [2018-10-15 12:39:51,623 INFO L226 Difference]: Without dead ends: 24929 [2018-10-15 12:39:51,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16801 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=16363, Invalid=54127, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 12:39:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24929 states. [2018-10-15 12:39:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24929 to 2959. [2018-10-15 12:39:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2959 states. [2018-10-15 12:39:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 3241 transitions. [2018-10-15 12:39:51,739 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 3241 transitions. Word has length 576 [2018-10-15 12:39:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:51,739 INFO L481 AbstractCegarLoop]: Abstraction has 2959 states and 3241 transitions. [2018-10-15 12:39:51,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-15 12:39:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 3241 transitions. [2018-10-15 12:39:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-10-15 12:39:51,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:51,742 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 50, 50, 50, 50, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:51,742 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:51,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1922838699, now seen corresponding path program 71 times [2018-10-15 12:39:51,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16935 backedges. 13888 proven. 2941 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-15 12:39:56,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:56,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:39:56,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:39:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:39:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2978, Invalid=12522, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:39:56,420 INFO L87 Difference]: Start difference. First operand 2959 states and 3241 transitions. Second operand 125 states. [2018-10-15 12:40:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:02,924 INFO L93 Difference]: Finished difference Result 26339 states and 29391 transitions. [2018-10-15 12:40:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 12:40:02,924 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 584 [2018-10-15 12:40:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:02,945 INFO L225 Difference]: With dead ends: 26339 [2018-10-15 12:40:02,945 INFO L226 Difference]: Without dead ends: 26339 [2018-10-15 12:40:02,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17324 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=16578, Invalid=55514, Unknown=0, NotChecked=0, Total=72092 [2018-10-15 12:40:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26339 states. [2018-10-15 12:40:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26339 to 2962. [2018-10-15 12:40:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2962 states. [2018-10-15 12:40:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 3244 transitions. [2018-10-15 12:40:03,065 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 3244 transitions. Word has length 584 [2018-10-15 12:40:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:03,066 INFO L481 AbstractCegarLoop]: Abstraction has 2962 states and 3244 transitions. [2018-10-15 12:40:03,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:40:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3244 transitions. [2018-10-15 12:40:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-10-15 12:40:03,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:03,069 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 50, 50, 50, 50, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:03,069 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:03,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:03,070 INFO L82 PathProgramCache]: Analyzing trace with hash -264751761, now seen corresponding path program 72 times [2018-10-15 12:40:03,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 17358 backedges. 14023 proven. 3224 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-15 12:40:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:07,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 12:40:07,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 12:40:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 12:40:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3002, Invalid=12748, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 12:40:07,667 INFO L87 Difference]: Start difference. First operand 2962 states and 3244 transitions. Second operand 126 states. [2018-10-15 12:40:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:15,085 INFO L93 Difference]: Finished difference Result 27768 states and 30990 transitions. [2018-10-15 12:40:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 12:40:15,085 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 592 [2018-10-15 12:40:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:15,104 INFO L225 Difference]: With dead ends: 27768 [2018-10-15 12:40:15,104 INFO L226 Difference]: Without dead ends: 27768 [2018-10-15 12:40:15,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17853 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=16798, Invalid=56914, Unknown=0, NotChecked=0, Total=73712 [2018-10-15 12:40:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27768 states. [2018-10-15 12:40:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27768 to 2965. [2018-10-15 12:40:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2018-10-15 12:40:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3247 transitions. [2018-10-15 12:40:15,208 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3247 transitions. Word has length 592 [2018-10-15 12:40:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:15,208 INFO L481 AbstractCegarLoop]: Abstraction has 2965 states and 3247 transitions. [2018-10-15 12:40:15,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 12:40:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3247 transitions. [2018-10-15 12:40:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-10-15 12:40:15,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:15,211 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 50, 50, 50, 50, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:15,211 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:15,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1477102029, now seen corresponding path program 73 times [2018-10-15 12:40:15,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17789 backedges. 14153 proven. 3520 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-15 12:40:19,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:19,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:40:19,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:40:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:40:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3027, Invalid=12975, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:40:19,718 INFO L87 Difference]: Start difference. First operand 2965 states and 3247 transitions. Second operand 127 states. [2018-10-15 12:40:27,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:27,539 INFO L93 Difference]: Finished difference Result 29216 states and 32610 transitions. [2018-10-15 12:40:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 12:40:27,540 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 600 [2018-10-15 12:40:27,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:27,562 INFO L225 Difference]: With dead ends: 29216 [2018-10-15 12:40:27,562 INFO L226 Difference]: Without dead ends: 29216 [2018-10-15 12:40:27,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18388 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17023, Invalid=58327, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:40:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29216 states. [2018-10-15 12:40:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29216 to 2968. [2018-10-15 12:40:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2018-10-15 12:40:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 3250 transitions. [2018-10-15 12:40:27,686 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 3250 transitions. Word has length 600 [2018-10-15 12:40:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:27,687 INFO L481 AbstractCegarLoop]: Abstraction has 2968 states and 3250 transitions. [2018-10-15 12:40:27,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:40:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 3250 transitions. [2018-10-15 12:40:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2018-10-15 12:40:27,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:27,689 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 50, 50, 50, 50, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:27,690 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:27,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -686345481, now seen corresponding path program 74 times [2018-10-15 12:40:27,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18228 backedges. 14278 proven. 3829 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-15 12:40:32,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:32,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 12:40:32,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 12:40:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 12:40:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3053, Invalid=13203, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 12:40:32,479 INFO L87 Difference]: Start difference. First operand 2968 states and 3250 transitions. Second operand 128 states. [2018-10-15 12:40:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:40,617 INFO L93 Difference]: Finished difference Result 30683 states and 34251 transitions. [2018-10-15 12:40:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 12:40:40,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 608 [2018-10-15 12:40:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:40,639 INFO L225 Difference]: With dead ends: 30683 [2018-10-15 12:40:40,639 INFO L226 Difference]: Without dead ends: 30683 [2018-10-15 12:40:40,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18929 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=17253, Invalid=59753, Unknown=0, NotChecked=0, Total=77006 [2018-10-15 12:40:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30683 states. [2018-10-15 12:40:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30683 to 2971. [2018-10-15 12:40:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2018-10-15 12:40:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 3253 transitions. [2018-10-15 12:40:40,759 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 3253 transitions. Word has length 608 [2018-10-15 12:40:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:40,759 INFO L481 AbstractCegarLoop]: Abstraction has 2971 states and 3253 transitions. [2018-10-15 12:40:40,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 12:40:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 3253 transitions. [2018-10-15 12:40:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-15 12:40:40,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:40,762 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 50, 50, 50, 50, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:40,762 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:40,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:40,763 INFO L82 PathProgramCache]: Analyzing trace with hash 920791995, now seen corresponding path program 75 times [2018-10-15 12:40:40,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18675 backedges. 14398 proven. 4151 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-15 12:40:45,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:45,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:40:45,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:40:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:40:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3080, Invalid=13432, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:40:45,648 INFO L87 Difference]: Start difference. First operand 2971 states and 3253 transitions. Second operand 129 states. [2018-10-15 12:40:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:53,619 INFO L93 Difference]: Finished difference Result 32167 states and 35911 transitions. [2018-10-15 12:40:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-15 12:40:53,619 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 616 [2018-10-15 12:40:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:53,642 INFO L225 Difference]: With dead ends: 32167 [2018-10-15 12:40:53,642 INFO L226 Difference]: Without dead ends: 32167 [2018-10-15 12:40:53,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19476 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17488, Invalid=61192, Unknown=0, NotChecked=0, Total=78680 [2018-10-15 12:40:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32167 states. [2018-10-15 12:40:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32167 to 2974. [2018-10-15 12:40:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2018-10-15 12:40:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3256 transitions. [2018-10-15 12:40:53,765 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3256 transitions. Word has length 616 [2018-10-15 12:40:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:53,765 INFO L481 AbstractCegarLoop]: Abstraction has 2974 states and 3256 transitions. [2018-10-15 12:40:53,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:40:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3256 transitions. [2018-10-15 12:40:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-10-15 12:40:53,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:53,769 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 50, 50, 50, 50, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:53,769 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:53,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash -57008001, now seen corresponding path program 76 times [2018-10-15 12:40:53,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19130 backedges. 14513 proven. 4486 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-15 12:40:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-10-15 12:40:58,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-15 12:40:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-15 12:40:58,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3108, Invalid=13662, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 12:40:58,528 INFO L87 Difference]: Start difference. First operand 2974 states and 3256 transitions. Second operand 130 states. [2018-10-15 12:41:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:06,524 INFO L93 Difference]: Finished difference Result 33703 states and 37629 transitions. [2018-10-15 12:41:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 12:41:06,524 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 624 [2018-10-15 12:41:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:06,550 INFO L225 Difference]: With dead ends: 33703 [2018-10-15 12:41:06,550 INFO L226 Difference]: Without dead ends: 33703 [2018-10-15 12:41:06,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20029 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=17728, Invalid=62644, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 12:41:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33703 states. [2018-10-15 12:41:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33703 to 2977. [2018-10-15 12:41:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2018-10-15 12:41:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 3259 transitions. [2018-10-15 12:41:06,666 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 3259 transitions. Word has length 624 [2018-10-15 12:41:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:06,667 INFO L481 AbstractCegarLoop]: Abstraction has 2977 states and 3259 transitions. [2018-10-15 12:41:06,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-15 12:41:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 3259 transitions. [2018-10-15 12:41:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-10-15 12:41:06,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:06,670 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 50, 50, 50, 50, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:06,671 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:06,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -645721789, now seen corresponding path program 77 times [2018-10-15 12:41:06,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19593 backedges. 14623 proven. 4834 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-15 12:41:11,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:11,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:41:11,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:41:11,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:41:11,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3137, Invalid=13893, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:41:11,342 INFO L87 Difference]: Start difference. First operand 2977 states and 3259 transitions. Second operand 131 states. [2018-10-15 12:41:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:19,842 INFO L93 Difference]: Finished difference Result 35378 states and 39500 transitions. [2018-10-15 12:41:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 12:41:19,842 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 632 [2018-10-15 12:41:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:19,867 INFO L225 Difference]: With dead ends: 35378 [2018-10-15 12:41:19,867 INFO L226 Difference]: Without dead ends: 35378 [2018-10-15 12:41:19,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20588 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=17973, Invalid=64109, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 12:41:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35378 states. [2018-10-15 12:41:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35378 to 2980. [2018-10-15 12:41:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2980 states. [2018-10-15 12:41:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 3262 transitions. [2018-10-15 12:41:20,001 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 3262 transitions. Word has length 632 [2018-10-15 12:41:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:20,001 INFO L481 AbstractCegarLoop]: Abstraction has 2980 states and 3262 transitions. [2018-10-15 12:41:20,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:41:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 3262 transitions. [2018-10-15 12:41:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-15 12:41:20,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:20,004 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 50, 50, 50, 50, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:20,004 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:20,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash -85918201, now seen corresponding path program 78 times [2018-10-15 12:41:20,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20064 backedges. 14728 proven. 5195 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-10-15 12:41:25,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:25,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-10-15 12:41:25,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-15 12:41:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-15 12:41:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3167, Invalid=14125, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 12:41:25,028 INFO L87 Difference]: Start difference. First operand 2980 states and 3262 transitions. Second operand 132 states. [2018-10-15 12:41:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:32,981 INFO L93 Difference]: Finished difference Result 37280 states and 41620 transitions. [2018-10-15 12:41:32,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-15 12:41:32,981 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 640 [2018-10-15 12:41:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:33,004 INFO L225 Difference]: With dead ends: 37280 [2018-10-15 12:41:33,004 INFO L226 Difference]: Without dead ends: 37280 [2018-10-15 12:41:33,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21153 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18223, Invalid=65587, Unknown=0, NotChecked=0, Total=83810 [2018-10-15 12:41:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37280 states. [2018-10-15 12:41:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37280 to 2983. [2018-10-15 12:41:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-15 12:41:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3265 transitions. [2018-10-15 12:41:33,136 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3265 transitions. Word has length 640 [2018-10-15 12:41:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:33,137 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 3265 transitions. [2018-10-15 12:41:33,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-15 12:41:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3265 transitions. [2018-10-15 12:41:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-15 12:41:33,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:33,140 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 50, 50, 50, 50, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:33,140 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:33,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 167241419, now seen corresponding path program 79 times [2018-10-15 12:41:33,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20543 backedges. 14828 proven. 5569 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-10-15 12:41:38,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:38,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:41:38,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:41:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:41:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3198, Invalid=14358, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:41:38,143 INFO L87 Difference]: Start difference. First operand 2983 states and 3265 transitions. Second operand 133 states. [2018-10-15 12:41:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:45,943 INFO L93 Difference]: Finished difference Result 39497 states and 44085 transitions. [2018-10-15 12:41:45,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:41:45,943 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 648 [2018-10-15 12:41:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:45,973 INFO L225 Difference]: With dead ends: 39497 [2018-10-15 12:41:45,973 INFO L226 Difference]: Without dead ends: 39497 [2018-10-15 12:41:45,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21724 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=18478, Invalid=67078, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 12:41:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39497 states. [2018-10-15 12:41:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39497 to 2986. [2018-10-15 12:41:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2018-10-15 12:41:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3268 transitions. [2018-10-15 12:41:46,118 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3268 transitions. Word has length 648 [2018-10-15 12:41:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:46,118 INFO L481 AbstractCegarLoop]: Abstraction has 2986 states and 3268 transitions. [2018-10-15 12:41:46,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:41:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3268 transitions. [2018-10-15 12:41:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-10-15 12:41:46,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:46,121 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 50, 50, 50, 50, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:46,122 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:46,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash 738970511, now seen corresponding path program 80 times [2018-10-15 12:41:46,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21030 backedges. 14923 proven. 5956 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-10-15 12:41:51,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-10-15 12:41:51,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-15 12:41:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-15 12:41:51,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3230, Invalid=14592, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 12:41:51,382 INFO L87 Difference]: Start difference. First operand 2986 states and 3268 transitions. Second operand 134 states. [2018-10-15 12:42:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:00,233 INFO L93 Difference]: Finished difference Result 42117 states and 46991 transitions. [2018-10-15 12:42:00,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 12:42:00,233 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 656 [2018-10-15 12:42:00,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:00,260 INFO L225 Difference]: With dead ends: 42117 [2018-10-15 12:42:00,260 INFO L226 Difference]: Without dead ends: 42117 [2018-10-15 12:42:00,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22301 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=18738, Invalid=68582, Unknown=0, NotChecked=0, Total=87320 [2018-10-15 12:42:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42117 states. [2018-10-15 12:42:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42117 to 2989. [2018-10-15 12:42:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2018-10-15 12:42:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 3271 transitions. [2018-10-15 12:42:00,385 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 3271 transitions. Word has length 656 [2018-10-15 12:42:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:00,385 INFO L481 AbstractCegarLoop]: Abstraction has 2989 states and 3271 transitions. [2018-10-15 12:42:00,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-15 12:42:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 3271 transitions. [2018-10-15 12:42:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-10-15 12:42:00,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:00,388 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 50, 50, 50, 50, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:00,389 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:00,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash 39890003, now seen corresponding path program 81 times [2018-10-15 12:42:00,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21525 backedges. 15013 proven. 6356 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-15 12:42:05,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:05,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:42:05,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:42:05,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:42:05,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3263, Invalid=14827, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:42:05,670 INFO L87 Difference]: Start difference. First operand 2989 states and 3271 transitions. Second operand 135 states. [2018-10-15 12:42:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:15,594 INFO L93 Difference]: Finished difference Result 45228 states and 50434 transitions. [2018-10-15 12:42:15,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-10-15 12:42:15,595 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 664 [2018-10-15 12:42:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:15,626 INFO L225 Difference]: With dead ends: 45228 [2018-10-15 12:42:15,627 INFO L226 Difference]: Without dead ends: 45228 [2018-10-15 12:42:15,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22884 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=19003, Invalid=70099, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 12:42:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45228 states. [2018-10-15 12:42:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45228 to 2992. [2018-10-15 12:42:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2992 states. [2018-10-15 12:42:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 3274 transitions. [2018-10-15 12:42:15,785 INFO L78 Accepts]: Start accepts. Automaton has 2992 states and 3274 transitions. Word has length 664 [2018-10-15 12:42:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:15,786 INFO L481 AbstractCegarLoop]: Abstraction has 2992 states and 3274 transitions. [2018-10-15 12:42:15,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:42:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 3274 transitions. [2018-10-15 12:42:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-15 12:42:15,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:15,790 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 50, 50, 50, 50, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:15,790 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:15,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1439004393, now seen corresponding path program 82 times [2018-10-15 12:42:15,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 22028 backedges. 15098 proven. 6769 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-10-15 12:42:21,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:21,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-10-15 12:42:21,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-15 12:42:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-15 12:42:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3297, Invalid=15063, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 12:42:21,066 INFO L87 Difference]: Start difference. First operand 2992 states and 3274 transitions. Second operand 136 states. [2018-10-15 12:42:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:29,905 INFO L93 Difference]: Finished difference Result 48757 states and 54334 transitions. [2018-10-15 12:42:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 12:42:29,905 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 672 [2018-10-15 12:42:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:30,021 INFO L225 Difference]: With dead ends: 48757 [2018-10-15 12:42:30,021 INFO L226 Difference]: Without dead ends: 48757 [2018-10-15 12:42:30,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23473 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19273, Invalid=71629, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 12:42:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48757 states. [2018-10-15 12:42:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48757 to 2990. [2018-10-15 12:42:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2018-10-15 12:42:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 3271 transitions. [2018-10-15 12:42:30,169 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 3271 transitions. Word has length 672 [2018-10-15 12:42:30,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:30,170 INFO L481 AbstractCegarLoop]: Abstraction has 2990 states and 3271 transitions. [2018-10-15 12:42:30,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-15 12:42:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 3271 transitions. [2018-10-15 12:42:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2018-10-15 12:42:30,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:30,173 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 50, 50, 50, 50, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:30,174 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:30,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1126342181, now seen corresponding path program 83 times [2018-10-15 12:42:30,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22539 backedges. 15178 proven. 7195 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-10-15 12:42:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:35,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:42:35,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:42:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:42:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3332, Invalid=15300, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:42:35,626 INFO L87 Difference]: Start difference. First operand 2990 states and 3271 transitions. Second operand 137 states. [2018-10-15 12:42:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:44,849 INFO L93 Difference]: Finished difference Result 52183 states and 58111 transitions. [2018-10-15 12:42:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 12:42:44,849 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 680 [2018-10-15 12:42:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:44,887 INFO L225 Difference]: With dead ends: 52183 [2018-10-15 12:42:44,887 INFO L226 Difference]: Without dead ends: 52183 [2018-10-15 12:42:44,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24068 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=19548, Invalid=73172, Unknown=0, NotChecked=0, Total=92720 [2018-10-15 12:42:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52183 states. [2018-10-15 12:42:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52183 to 2985. [2018-10-15 12:42:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2018-10-15 12:42:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 3265 transitions. [2018-10-15 12:42:45,066 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 3265 transitions. Word has length 680 [2018-10-15 12:42:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:45,067 INFO L481 AbstractCegarLoop]: Abstraction has 2985 states and 3265 transitions. [2018-10-15 12:42:45,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:42:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 3265 transitions. [2018-10-15 12:42:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-10-15 12:42:45,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:45,071 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 50, 50, 50, 50, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:45,071 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:45,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1334654623, now seen corresponding path program 84 times [2018-10-15 12:42:45,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23058 backedges. 15253 proven. 7634 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-15 12:42:50,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 12:42:50,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 12:42:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 12:42:50,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3368, Invalid=15538, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 12:42:50,678 INFO L87 Difference]: Start difference. First operand 2985 states and 3265 transitions. Second operand 138 states. [2018-10-15 12:42:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:59,197 INFO L93 Difference]: Finished difference Result 55532 states and 61807 transitions. [2018-10-15 12:42:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-10-15 12:42:59,197 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 688 [2018-10-15 12:42:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:59,236 INFO L225 Difference]: With dead ends: 55532 [2018-10-15 12:42:59,236 INFO L226 Difference]: Without dead ends: 55532 [2018-10-15 12:42:59,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24669 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=19828, Invalid=74728, Unknown=0, NotChecked=0, Total=94556 [2018-10-15 12:42:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55532 states. [2018-10-15 12:42:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55532 to 2980. [2018-10-15 12:42:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2980 states. [2018-10-15 12:42:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 3259 transitions. [2018-10-15 12:42:59,422 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 3259 transitions. Word has length 688 [2018-10-15 12:42:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:59,423 INFO L481 AbstractCegarLoop]: Abstraction has 2980 states and 3259 transitions. [2018-10-15 12:42:59,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 12:42:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 3259 transitions. [2018-10-15 12:42:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2018-10-15 12:42:59,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:59,427 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 50, 50, 50, 50, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:59,427 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:59,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash -208795805, now seen corresponding path program 85 times [2018-10-15 12:42:59,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 23585 backedges. 15323 proven. 8086 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-15 12:43:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:05,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:43:05,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:43:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:43:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=15777, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:43:05,121 INFO L87 Difference]: Start difference. First operand 2980 states and 3259 transitions. Second operand 139 states. [2018-10-15 12:43:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:15,218 INFO L93 Difference]: Finished difference Result 58855 states and 65473 transitions. [2018-10-15 12:43:15,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-15 12:43:15,218 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 696 [2018-10-15 12:43:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:15,255 INFO L225 Difference]: With dead ends: 58855 [2018-10-15 12:43:15,255 INFO L226 Difference]: Without dead ends: 58855 [2018-10-15 12:43:15,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25276 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20113, Invalid=76297, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 12:43:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58855 states. [2018-10-15 12:43:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58855 to 2975. [2018-10-15 12:43:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2018-10-15 12:43:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3253 transitions. [2018-10-15 12:43:15,457 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3253 transitions. Word has length 696 [2018-10-15 12:43:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:15,457 INFO L481 AbstractCegarLoop]: Abstraction has 2975 states and 3253 transitions. [2018-10-15 12:43:15,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:43:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3253 transitions. [2018-10-15 12:43:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-10-15 12:43:15,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:15,461 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 50, 50, 50, 50, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:15,462 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:15,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1239165913, now seen corresponding path program 86 times [2018-10-15 12:43:15,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24120 backedges. 15388 proven. 8551 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-10-15 12:43:21,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:21,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-10-15 12:43:21,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-15 12:43:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-15 12:43:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3443, Invalid=16017, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 12:43:21,171 INFO L87 Difference]: Start difference. First operand 2975 states and 3253 transitions. Second operand 140 states.