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/array_false-unreach-call3_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:26:23,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:26:23,923 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:26:23,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:26:23,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:26:23,940 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:26:23,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:26:23,944 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:26:23,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:26:23,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:26:23,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:26:23,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:26:23,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:26:23,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:26:23,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:26:23,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:26:23,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:26:23,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:26:23,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:26:23,958 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:26:23,960 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:26:23,961 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:26:23,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:26:23,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:26:23,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:26:23,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:26:23,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:26:23,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:26:23,968 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:26:23,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:26:23,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:26:23,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:26:23,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:26:23,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:26:23,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:26:23,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:26:23,973 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:26:23,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:26:23,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:26:23,991 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:26:23,991 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:26:23,991 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:26:23,991 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:26:23,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:26:23,995 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:26:23,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:26:23,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:26:23,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:26:23,996 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:26:23,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:26:23,997 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:26:23,997 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:26:24,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:26:24,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:26:24,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:26:24,074 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:26:24,075 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:26:24,076 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_5.bpl [2018-10-15 12:26:24,076 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_false-unreach-call3_true-termination.i_5.bpl' [2018-10-15 12:26:24,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:26:24,128 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:26:24,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:26:24,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:26:24,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:26:24,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/1) ... [2018-10-15 12:26:24,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:26:24,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:26:24,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:26:24,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:26:24,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (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:26:24,260 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:26:24,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:26:24,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:26:24,738 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:26:24,739 INFO L202 PluginConnector]: Adding new model array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24 BoogieIcfgContainer [2018-10-15 12:26:24,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:26:24,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:26:24,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:26:24,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:26:24,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:24" (1/2) ... [2018-10-15 12:26:24,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31356d6a and model type array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:26:24, skipping insertion in model container [2018-10-15 12:26:24,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_false-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24" (2/2) ... [2018-10-15 12:26:24,750 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call3_true-termination.i_5.bpl [2018-10-15 12:26:24,761 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:26:24,773 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:26:24,793 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:26:24,828 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:26:24,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:26:24,829 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:26:24,829 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:26:24,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:26:24,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:26:24,830 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:26:24,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:26:24,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:26:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-10-15 12:26:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:26:24,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:24,874 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, 1, 1, 1, 1, 1] [2018-10-15 12:26:24,875 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:24,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1214943719, now seen corresponding path program 1 times [2018-10-15 12:26:24,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,063 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:26:25,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:26:25,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:26:25,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:26:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:26:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:25,088 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-10-15 12:26:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,222 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-10-15 12:26:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:26:25,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-15 12:26:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,234 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:26:25,235 INFO L226 Difference]: Without dead ends: 67 [2018-10-15 12:26:25,237 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:26:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-15 12:26:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2018-10-15 12:26:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-15 12:26:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-10-15 12:26:25,279 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 29 [2018-10-15 12:26:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,280 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-10-15 12:26:25,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:26:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-10-15 12:26:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:26:25,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,282 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash 422725346, now seen corresponding path program 1 times [2018-10-15 12:26:25,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:25,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:26:25,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:26:25,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:26:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:26:25,426 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 5 states. [2018-10-15 12:26:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,884 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-10-15 12:26:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:26:25,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:26:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,886 INFO L225 Difference]: With dead ends: 77 [2018-10-15 12:26:25,886 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 12:26:25,888 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:26:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 12:26:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-10-15 12:26:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 12:26:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-15 12:26:25,896 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 39 [2018-10-15 12:26:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,896 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-15 12:26:25,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:26:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-15 12:26:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:26:25,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,899 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,899 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1490797027, now seen corresponding path program 2 times [2018-10-15 12:26:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:26,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:26,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:26:26,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:26:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:26:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:26,066 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 7 states. [2018-10-15 12:26:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:26,376 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-15 12:26:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:26:26,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-15 12:26:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:26,378 INFO L225 Difference]: With dead ends: 87 [2018-10-15 12:26:26,379 INFO L226 Difference]: Without dead ends: 87 [2018-10-15 12:26:26,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-15 12:26:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2018-10-15 12:26:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-15 12:26:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-10-15 12:26:26,388 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 49 [2018-10-15 12:26:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:26,389 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-10-15 12:26:26,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:26:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-10-15 12:26:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:26:26,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:26,392 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:26,392 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:26,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 889366424, now seen corresponding path program 3 times [2018-10-15 12:26:26,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:26,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:26,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:26:26,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:26:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:26:26,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:26:26,550 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 9 states. [2018-10-15 12:26:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:27,207 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 12:26:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:26:27,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-15 12:26:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:27,211 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:26:27,211 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:26:27,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:26:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-10-15 12:26:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:26:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-10-15 12:26:27,220 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 59 [2018-10-15 12:26:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:27,220 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-10-15 12:26:27,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:26:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-10-15 12:26:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:26:27,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:27,223 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:27,224 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:27,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash -594300077, now seen corresponding path program 4 times [2018-10-15 12:26:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:27,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:27,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:26:27,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:26:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:26:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:27,426 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 11 states. [2018-10-15 12:26:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,085 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-10-15 12:26:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:26:28,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-15 12:26:28,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,088 INFO L225 Difference]: With dead ends: 107 [2018-10-15 12:26:28,088 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 12:26:28,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 12:26:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2018-10-15 12:26:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 12:26:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-15 12:26:28,096 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 69 [2018-10-15 12:26:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,097 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-15 12:26:28,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:26:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-15 12:26:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:26:28,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,099 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,099 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1717464754, now seen corresponding path program 5 times [2018-10-15 12:26:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:28,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:28,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:26:28,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:26:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:26:28,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:26:28,346 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 13 states. [2018-10-15 12:26:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,665 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-10-15 12:26:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:26:28,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-15 12:26:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,668 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:26:28,668 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:26:28,669 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:26:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:26:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2018-10-15 12:26:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-15 12:26:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-10-15 12:26:28,683 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 79 [2018-10-15 12:26:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,684 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-10-15 12:26:28,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:26:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-10-15 12:26:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:26:28,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,689 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,689 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1795526263, now seen corresponding path program 6 times [2018-10-15 12:26:28,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:28,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:28,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:26:28,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:26:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:26:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:28,930 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2018-10-15 12:26:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:29,310 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-10-15 12:26:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:26:29,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 12:26:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:29,312 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:26:29,312 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:26:29,313 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:26:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:26:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2018-10-15 12:26:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 12:26:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-10-15 12:26:29,320 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 89 [2018-10-15 12:26:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:29,321 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-10-15 12:26:29,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:26:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-10-15 12:26:29,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:26:29,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:29,323 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:29,323 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:29,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1351580668, now seen corresponding path program 7 times [2018-10-15 12:26:29,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:29,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:29,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:26:29,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:26:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:26:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:26:29,689 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 17 states. [2018-10-15 12:26:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:30,274 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-10-15 12:26:30,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:26:30,280 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-10-15 12:26:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:30,282 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:26:30,282 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:26:30,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:30,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:26:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2018-10-15 12:26:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 12:26:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-10-15 12:26:30,288 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 99 [2018-10-15 12:26:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:30,289 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-10-15 12:26:30,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:26:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-10-15 12:26:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:26:30,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:30,291 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:30,291 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:30,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1289353407, now seen corresponding path program 8 times [2018-10-15 12:26:30,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:26:30,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:26:30,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:26:30,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:30,814 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 19 states. [2018-10-15 12:26:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:31,535 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-10-15 12:26:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:26:31,536 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-10-15 12:26:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:31,537 INFO L225 Difference]: With dead ends: 147 [2018-10-15 12:26:31,537 INFO L226 Difference]: Without dead ends: 147 [2018-10-15 12:26:31,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-15 12:26:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2018-10-15 12:26:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-15 12:26:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-10-15 12:26:31,544 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 109 [2018-10-15 12:26:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:31,544 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-10-15 12:26:31,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:26:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-10-15 12:26:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:26:31,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:31,546 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:31,547 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:31,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:31,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1594949562, now seen corresponding path program 9 times [2018-10-15 12:26:31,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:26:31,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:26:31,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:26:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:26:31,954 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 21 states. [2018-10-15 12:26:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:32,465 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-10-15 12:26:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:26:32,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 12:26:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:32,467 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:26:32,467 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 12:26:32,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 12:26:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2018-10-15 12:26:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 12:26:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-10-15 12:26:32,474 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 119 [2018-10-15 12:26:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:32,474 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-10-15 12:26:32,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:26:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-10-15 12:26:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:26:32,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:32,476 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:32,476 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:32,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1326200587, now seen corresponding path program 10 times [2018-10-15 12:26:32,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:32,766 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:32,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:32,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:26:32,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:26:32,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:26:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:32,768 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 23 states. [2018-10-15 12:26:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:33,330 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-10-15 12:26:33,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:26:33,331 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-10-15 12:26:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:33,333 INFO L225 Difference]: With dead ends: 167 [2018-10-15 12:26:33,333 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 12:26:33,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 12:26:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-10-15 12:26:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-15 12:26:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-10-15 12:26:33,338 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 129 [2018-10-15 12:26:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:33,339 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-10-15 12:26:33,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:26:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-10-15 12:26:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:26:33,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:33,341 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:33,341 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:33,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1902412912, now seen corresponding path program 11 times [2018-10-15 12:26:33,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:33,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:33,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:26:33,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:26:33,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:26:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:26:33,929 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 25 states. [2018-10-15 12:26:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:34,453 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-10-15 12:26:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:26:34,454 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-10-15 12:26:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:34,455 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:26:34,456 INFO L226 Difference]: Without dead ends: 177 [2018-10-15 12:26:34,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-15 12:26:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-10-15 12:26:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-15 12:26:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-10-15 12:26:34,461 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 139 [2018-10-15 12:26:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:34,462 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-10-15 12:26:34,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:26:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-10-15 12:26:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:26:34,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:34,464 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:34,464 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:34,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -28745173, now seen corresponding path program 12 times [2018-10-15 12:26:34,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:35,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:35,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:26:35,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:26:35,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:26:35,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:35,411 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 27 states. [2018-10-15 12:26:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:36,384 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-10-15 12:26:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:26:36,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-10-15 12:26:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:36,386 INFO L225 Difference]: With dead ends: 187 [2018-10-15 12:26:36,386 INFO L226 Difference]: Without dead ends: 187 [2018-10-15 12:26:36,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:26:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-15 12:26:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2018-10-15 12:26:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:26:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2018-10-15 12:26:36,392 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 149 [2018-10-15 12:26:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:36,392 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2018-10-15 12:26:36,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:26:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2018-10-15 12:26:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:26:36,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:36,395 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:36,395 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:36,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash -276000218, now seen corresponding path program 13 times [2018-10-15 12:26:36,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:37,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:37,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:26:37,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:26:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:26:37,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:26:37,093 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 29 states. [2018-10-15 12:26:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:38,198 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-10-15 12:26:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:26:38,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2018-10-15 12:26:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:38,201 INFO L225 Difference]: With dead ends: 197 [2018-10-15 12:26:38,201 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 12:26:38,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:26:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 12:26:38,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2018-10-15 12:26:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-15 12:26:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-10-15 12:26:38,206 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 159 [2018-10-15 12:26:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:38,207 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-10-15 12:26:38,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:26:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-10-15 12:26:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:26:38,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:38,208 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:38,209 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:38,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1646019681, now seen corresponding path program 14 times [2018-10-15 12:26:38,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:38,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:26:38,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:26:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:26:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:38,664 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 31 states. [2018-10-15 12:26:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:39,299 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-10-15 12:26:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:26:39,299 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 169 [2018-10-15 12:26:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:39,301 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:26:39,301 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:26:39,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:26:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:26:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2018-10-15 12:26:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-15 12:26:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-10-15 12:26:39,308 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 169 [2018-10-15 12:26:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:39,308 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-10-15 12:26:39,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:26:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-10-15 12:26:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:26:39,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:39,309 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:39,310 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:39,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2098550564, now seen corresponding path program 15 times [2018-10-15 12:26:39,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:40,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:26:40,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:26:40,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:26:40,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:26:40,407 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 33 states. [2018-10-15 12:26:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:41,570 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-10-15 12:26:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:26:41,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2018-10-15 12:26:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:41,573 INFO L225 Difference]: With dead ends: 217 [2018-10-15 12:26:41,573 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:26:41,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:26:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:26:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 194. [2018-10-15 12:26:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 12:26:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-10-15 12:26:41,578 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 179 [2018-10-15 12:26:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:41,579 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-10-15 12:26:41,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:26:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-10-15 12:26:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:26:41,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:41,580 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:41,581 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:41,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1508765591, now seen corresponding path program 16 times [2018-10-15 12:26:41,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:26:42,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:26:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:26:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:42,111 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 35 states. [2018-10-15 12:26:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:43,029 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-10-15 12:26:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:26:43,030 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-10-15 12:26:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:43,032 INFO L225 Difference]: With dead ends: 227 [2018-10-15 12:26:43,032 INFO L226 Difference]: Without dead ends: 227 [2018-10-15 12:26:43,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:26:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-15 12:26:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 204. [2018-10-15 12:26:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 12:26:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-10-15 12:26:43,037 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 189 [2018-10-15 12:26:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:43,037 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-10-15 12:26:43,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:26:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-10-15 12:26:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:26:43,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:43,040 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:43,040 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:43,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash -719304558, now seen corresponding path program 17 times [2018-10-15 12:26:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:43,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:26:43,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:26:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:26:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:26:43,608 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 37 states. [2018-10-15 12:26:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:44,643 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-10-15 12:26:44,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:26:44,643 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 199 [2018-10-15 12:26:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:44,645 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:26:44,645 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 12:26:44,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:26:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 12:26:44,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 214. [2018-10-15 12:26:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-15 12:26:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-10-15 12:26:44,652 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 199 [2018-10-15 12:26:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:44,652 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-10-15 12:26:44,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:26:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-10-15 12:26:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:26:44,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:44,653 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:44,654 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:44,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash 327148493, now seen corresponding path program 18 times [2018-10-15 12:26:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:45,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:45,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:26:45,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:26:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:26:45,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:45,399 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 39 states. [2018-10-15 12:26:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:46,809 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-10-15 12:26:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:26:46,810 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-10-15 12:26:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:46,812 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:26:46,812 INFO L226 Difference]: Without dead ends: 247 [2018-10-15 12:26:46,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:26:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-15 12:26:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2018-10-15 12:26:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 12:26:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2018-10-15 12:26:46,819 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 209 [2018-10-15 12:26:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:46,819 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2018-10-15 12:26:46,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:26:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2018-10-15 12:26:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:26:46,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:46,821 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:46,821 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:46,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash -267456184, now seen corresponding path program 19 times [2018-10-15 12:26:46,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:47,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:47,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:26:47,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:26:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:26:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:26:47,854 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 41 states. [2018-10-15 12:26:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:49,010 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-10-15 12:26:49,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:26:49,010 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 219 [2018-10-15 12:26:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:49,013 INFO L225 Difference]: With dead ends: 257 [2018-10-15 12:26:49,013 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 12:26:49,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:26:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 12:26:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 234. [2018-10-15 12:26:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-15 12:26:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-10-15 12:26:49,019 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 219 [2018-10-15 12:26:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:49,020 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-10-15 12:26:49,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:26:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-10-15 12:26:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:26:49,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:49,021 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:49,022 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:49,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -858545917, now seen corresponding path program 20 times [2018-10-15 12:26:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:50,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:50,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:26:50,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:26:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:26:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:50,034 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 43 states. [2018-10-15 12:26:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:51,851 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-10-15 12:26:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:26:51,852 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-10-15 12:26:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:51,854 INFO L225 Difference]: With dead ends: 267 [2018-10-15 12:26:51,854 INFO L226 Difference]: Without dead ends: 267 [2018-10-15 12:26:51,857 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:26:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-15 12:26:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 244. [2018-10-15 12:26:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-15 12:26:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 245 transitions. [2018-10-15 12:26:51,861 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 245 transitions. Word has length 229 [2018-10-15 12:26:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:51,861 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 245 transitions. [2018-10-15 12:26:51,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:26:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 245 transitions. [2018-10-15 12:26:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:26:51,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:51,863 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:51,863 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:51,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1646779650, now seen corresponding path program 21 times [2018-10-15 12:26:51,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:52,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:52,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:26:52,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:26:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:26:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:26:52,605 INFO L87 Difference]: Start difference. First operand 244 states and 245 transitions. Second operand 45 states. [2018-10-15 12:26:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:53,849 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-10-15 12:26:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:26:53,855 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:26:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:53,857 INFO L225 Difference]: With dead ends: 277 [2018-10-15 12:26:53,857 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 12:26:53,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:26:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 12:26:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2018-10-15 12:26:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 12:26:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 255 transitions. [2018-10-15 12:26:53,862 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 255 transitions. Word has length 239 [2018-10-15 12:26:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:53,863 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 255 transitions. [2018-10-15 12:26:53,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:26:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 255 transitions. [2018-10-15 12:26:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:26:53,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:53,865 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:53,865 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:53,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash 875210553, now seen corresponding path program 22 times [2018-10-15 12:26:53,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:55,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:55,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:26:55,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:26:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:26:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:55,322 INFO L87 Difference]: Start difference. First operand 254 states and 255 transitions. Second operand 47 states. [2018-10-15 12:26:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:58,657 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2018-10-15 12:26:58,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:26:58,657 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 249 [2018-10-15 12:26:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:58,659 INFO L225 Difference]: With dead ends: 287 [2018-10-15 12:26:58,659 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 12:26:58,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:26:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 12:26:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 264. [2018-10-15 12:26:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-15 12:26:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-10-15 12:26:58,664 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 249 [2018-10-15 12:26:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:58,665 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-10-15 12:26:58,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:26:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-10-15 12:26:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:26:58,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:58,667 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:58,667 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:58,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -925016652, now seen corresponding path program 23 times [2018-10-15 12:26:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:00,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:27:00,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:27:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:27:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:27:00,579 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 49 states. [2018-10-15 12:27:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:02,299 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-10-15 12:27:02,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:27:02,300 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 259 [2018-10-15 12:27:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:02,303 INFO L225 Difference]: With dead ends: 297 [2018-10-15 12:27:02,303 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:27:02,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:27:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:27:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 274. [2018-10-15 12:27:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-15 12:27:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-10-15 12:27:02,309 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 259 [2018-10-15 12:27:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:02,310 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-10-15 12:27:02,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:27:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-10-15 12:27:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:27:02,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:02,311 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:02,312 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:02,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -939100561, now seen corresponding path program 24 times [2018-10-15 12:27:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:04,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:04,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:27:04,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:27:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:27:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:27:04,226 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 51 states. [2018-10-15 12:27:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:05,710 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-10-15 12:27:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:27:05,710 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 269 [2018-10-15 12:27:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:05,713 INFO L225 Difference]: With dead ends: 307 [2018-10-15 12:27:05,713 INFO L226 Difference]: Without dead ends: 307 [2018-10-15 12:27:05,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:27:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-15 12:27:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 284. [2018-10-15 12:27:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 12:27:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2018-10-15 12:27:05,719 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 269 [2018-10-15 12:27:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:05,719 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 285 transitions. [2018-10-15 12:27:05,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:27:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 285 transitions. [2018-10-15 12:27:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:27:05,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:05,721 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:05,721 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:05,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -608165526, now seen corresponding path program 25 times [2018-10-15 12:27:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:27:06,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:27:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:27:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:27:06,661 INFO L87 Difference]: Start difference. First operand 284 states and 285 transitions. Second operand 53 states. [2018-10-15 12:27:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:08,596 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-10-15 12:27:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:27:08,597 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2018-10-15 12:27:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:08,599 INFO L225 Difference]: With dead ends: 317 [2018-10-15 12:27:08,599 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 12:27:08,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:27:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 12:27:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 294. [2018-10-15 12:27:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 12:27:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-15 12:27:08,607 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 279 [2018-10-15 12:27:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:08,607 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-15 12:27:08,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:27:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-15 12:27:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:27:08,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:08,609 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:08,609 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:08,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:08,610 INFO L82 PathProgramCache]: Analyzing trace with hash 925404837, now seen corresponding path program 26 times [2018-10-15 12:27:08,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3276 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:09,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:09,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:27:09,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:27:09,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:27:09,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:27:09,819 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 55 states. [2018-10-15 12:27:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:11,704 INFO L93 Difference]: Finished difference Result 327 states and 328 transitions. [2018-10-15 12:27:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:27:11,704 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 289 [2018-10-15 12:27:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:11,706 INFO L225 Difference]: With dead ends: 327 [2018-10-15 12:27:11,706 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 12:27:11,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:27:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 12:27:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 304. [2018-10-15 12:27:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-15 12:27:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 305 transitions. [2018-10-15 12:27:11,712 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 305 transitions. Word has length 289 [2018-10-15 12:27:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:11,713 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 305 transitions. [2018-10-15 12:27:11,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:27:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 305 transitions. [2018-10-15 12:27:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:27:11,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:11,715 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:11,715 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:11,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash 560066080, now seen corresponding path program 27 times [2018-10-15 12:27:11,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:13,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:13,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:27:13,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:27:13,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:27:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:27:13,022 INFO L87 Difference]: Start difference. First operand 304 states and 305 transitions. Second operand 57 states. [2018-10-15 12:27:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:14,944 INFO L93 Difference]: Finished difference Result 337 states and 338 transitions. [2018-10-15 12:27:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:27:14,944 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 299 [2018-10-15 12:27:14,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:14,947 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:27:14,947 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:27:14,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:27:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:27:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 314. [2018-10-15 12:27:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 12:27:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 315 transitions. [2018-10-15 12:27:14,953 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 315 transitions. Word has length 299 [2018-10-15 12:27:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:14,954 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 315 transitions. [2018-10-15 12:27:14,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:27:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 315 transitions. [2018-10-15 12:27:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:27:14,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:14,956 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:14,956 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:14,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1064144933, now seen corresponding path program 28 times [2018-10-15 12:27:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:16,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:16,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:27:16,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:27:16,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:27:16,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:27:16,571 INFO L87 Difference]: Start difference. First operand 314 states and 315 transitions. Second operand 59 states. [2018-10-15 12:27:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:18,887 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-10-15 12:27:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:27:18,887 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 309 [2018-10-15 12:27:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:18,889 INFO L225 Difference]: With dead ends: 347 [2018-10-15 12:27:18,889 INFO L226 Difference]: Without dead ends: 347 [2018-10-15 12:27:18,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:27:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-15 12:27:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 324. [2018-10-15 12:27:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-15 12:27:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-10-15 12:27:18,894 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 309 [2018-10-15 12:27:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:18,895 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-10-15 12:27:18,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:27:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-10-15 12:27:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:27:18,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:18,896 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:18,896 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:18,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 618939350, now seen corresponding path program 29 times [2018-10-15 12:27:18,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4089 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:20,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:20,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:27:20,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:27:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:27:20,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:27:20,455 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 61 states. [2018-10-15 12:27:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:22,739 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-10-15 12:27:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:27:22,740 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 319 [2018-10-15 12:27:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:22,742 INFO L225 Difference]: With dead ends: 357 [2018-10-15 12:27:22,742 INFO L226 Difference]: Without dead ends: 357 [2018-10-15 12:27:22,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:27:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-15 12:27:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 334. [2018-10-15 12:27:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-15 12:27:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-10-15 12:27:22,748 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 319 [2018-10-15 12:27:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:22,748 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-10-15 12:27:22,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:27:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-10-15 12:27:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:27:22,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:22,751 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:22,751 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:22,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:22,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1819960815, now seen corresponding path program 30 times [2018-10-15 12:27:22,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:24,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:24,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:27:24,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:27:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:27:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:27:24,276 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 63 states. [2018-10-15 12:27:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:26,641 INFO L93 Difference]: Finished difference Result 367 states and 368 transitions. [2018-10-15 12:27:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:27:26,642 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 329 [2018-10-15 12:27:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:26,644 INFO L225 Difference]: With dead ends: 367 [2018-10-15 12:27:26,644 INFO L226 Difference]: Without dead ends: 367 [2018-10-15 12:27:26,645 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:27:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-15 12:27:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 344. [2018-10-15 12:27:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:27:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 345 transitions. [2018-10-15 12:27:26,650 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 345 transitions. Word has length 329 [2018-10-15 12:27:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:26,650 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 345 transitions. [2018-10-15 12:27:26,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:27:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 345 transitions. [2018-10-15 12:27:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:27:26,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:26,653 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:26,653 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:26,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash 296264332, now seen corresponding path program 31 times [2018-10-15 12:27:26,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4681 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:28,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:28,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:27:28,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:27:28,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:27:28,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:27:28,580 INFO L87 Difference]: Start difference. First operand 344 states and 345 transitions. Second operand 65 states. [2018-10-15 12:27:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:31,166 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-10-15 12:27:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:27:31,167 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 339 [2018-10-15 12:27:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:31,169 INFO L225 Difference]: With dead ends: 377 [2018-10-15 12:27:31,169 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 12:27:31,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:27:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 12:27:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 354. [2018-10-15 12:27:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-15 12:27:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2018-10-15 12:27:31,175 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 339 [2018-10-15 12:27:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:31,175 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 355 transitions. [2018-10-15 12:27:31,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:27:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 355 transitions. [2018-10-15 12:27:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 12:27:31,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:31,177 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:31,178 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:31,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 797150535, now seen corresponding path program 32 times [2018-10-15 12:27:31,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:27:33,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:27:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:27:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:27:33,378 INFO L87 Difference]: Start difference. First operand 354 states and 355 transitions. Second operand 67 states. [2018-10-15 12:27:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:35,868 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-10-15 12:27:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:27:35,869 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 349 [2018-10-15 12:27:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:35,871 INFO L225 Difference]: With dead ends: 387 [2018-10-15 12:27:35,871 INFO L226 Difference]: Without dead ends: 387 [2018-10-15 12:27:35,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:27:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-15 12:27:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 364. [2018-10-15 12:27:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-15 12:27:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 365 transitions. [2018-10-15 12:27:35,878 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 365 transitions. Word has length 349 [2018-10-15 12:27:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:35,878 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 365 transitions. [2018-10-15 12:27:35,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:27:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 365 transitions. [2018-10-15 12:27:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:27:35,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:35,880 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:35,881 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:35,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 324045378, now seen corresponding path program 33 times [2018-10-15 12:27:35,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:37,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:37,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:27:37,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:27:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:27:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:27:37,612 INFO L87 Difference]: Start difference. First operand 364 states and 365 transitions. Second operand 69 states. [2018-10-15 12:27:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:40,423 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-10-15 12:27:40,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:27:40,423 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 359 [2018-10-15 12:27:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:40,425 INFO L225 Difference]: With dead ends: 397 [2018-10-15 12:27:40,425 INFO L226 Difference]: Without dead ends: 397 [2018-10-15 12:27:40,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:27:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-15 12:27:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 374. [2018-10-15 12:27:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 12:27:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 375 transitions. [2018-10-15 12:27:40,431 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 375 transitions. Word has length 359 [2018-10-15 12:27:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:40,431 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 375 transitions. [2018-10-15 12:27:40,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:27:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 375 transitions. [2018-10-15 12:27:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:27:40,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:40,433 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:40,434 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:40,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1001535107, now seen corresponding path program 34 times [2018-10-15 12:27:40,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5644 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:43,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:43,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:27:43,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:27:43,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:27:43,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:27:43,747 INFO L87 Difference]: Start difference. First operand 374 states and 375 transitions. Second operand 71 states. [2018-10-15 12:27:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:46,463 INFO L93 Difference]: Finished difference Result 407 states and 408 transitions. [2018-10-15 12:27:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:27:46,463 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 369 [2018-10-15 12:27:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:46,465 INFO L225 Difference]: With dead ends: 407 [2018-10-15 12:27:46,465 INFO L226 Difference]: Without dead ends: 407 [2018-10-15 12:27:46,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:27:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-15 12:27:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 384. [2018-10-15 12:27:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-15 12:27:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-10-15 12:27:46,470 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 369 [2018-10-15 12:27:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:46,470 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-10-15 12:27:46,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:27:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-10-15 12:27:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:27:46,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:46,472 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:46,472 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:46,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1245873416, now seen corresponding path program 35 times [2018-10-15 12:27:46,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:48,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:48,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:27:48,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:27:48,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:27:48,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:27:48,487 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 73 states. [2018-10-15 12:27:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:51,539 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-10-15 12:27:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:27:51,540 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 379 [2018-10-15 12:27:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:51,541 INFO L225 Difference]: With dead ends: 417 [2018-10-15 12:27:51,541 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 12:27:51,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:27:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 12:27:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 394. [2018-10-15 12:27:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-15 12:27:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 395 transitions. [2018-10-15 12:27:51,547 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 395 transitions. Word has length 379 [2018-10-15 12:27:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:51,547 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 395 transitions. [2018-10-15 12:27:51,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:27:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 395 transitions. [2018-10-15 12:27:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 12:27:51,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:51,550 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:51,550 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:51,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1847210317, now seen corresponding path program 36 times [2018-10-15 12:27:51,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6336 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:53,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:53,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:27:53,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:27:53,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:27:53,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:27:53,838 INFO L87 Difference]: Start difference. First operand 394 states and 395 transitions. Second operand 75 states. [2018-10-15 12:27:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:57,079 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-10-15 12:27:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:27:57,080 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 389 [2018-10-15 12:27:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:57,082 INFO L225 Difference]: With dead ends: 427 [2018-10-15 12:27:57,082 INFO L226 Difference]: Without dead ends: 427 [2018-10-15 12:27:57,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:27:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-15 12:27:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 404. [2018-10-15 12:27:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-15 12:27:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 405 transitions. [2018-10-15 12:27:57,087 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 405 transitions. Word has length 389 [2018-10-15 12:27:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:57,087 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 405 transitions. [2018-10-15 12:27:57,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:27:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 405 transitions. [2018-10-15 12:27:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 12:27:57,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:57,090 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:57,090 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:57,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1158739118, now seen corresponding path program 37 times [2018-10-15 12:27:57,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:59,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:59,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:27:59,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:27:59,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:27:59,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:27:59,431 INFO L87 Difference]: Start difference. First operand 404 states and 405 transitions. Second operand 77 states. [2018-10-15 12:28:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:02,513 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-10-15 12:28:02,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:28:02,513 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 399 [2018-10-15 12:28:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:02,515 INFO L225 Difference]: With dead ends: 437 [2018-10-15 12:28:02,515 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 12:28:02,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:28:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 12:28:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 414. [2018-10-15 12:28:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-15 12:28:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 415 transitions. [2018-10-15 12:28:02,521 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 415 transitions. Word has length 399 [2018-10-15 12:28:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:02,521 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 415 transitions. [2018-10-15 12:28:02,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:28:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 415 transitions. [2018-10-15 12:28:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:28:02,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:02,524 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:02,524 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:02,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1217207529, now seen corresponding path program 38 times [2018-10-15 12:28:02,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:04,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:04,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:28:04,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:28:04,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:28:04,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:28:04,795 INFO L87 Difference]: Start difference. First operand 414 states and 415 transitions. Second operand 79 states. [2018-10-15 12:28:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:08,541 INFO L93 Difference]: Finished difference Result 447 states and 448 transitions. [2018-10-15 12:28:08,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:28:08,541 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 409 [2018-10-15 12:28:08,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:08,543 INFO L225 Difference]: With dead ends: 447 [2018-10-15 12:28:08,544 INFO L226 Difference]: Without dead ends: 447 [2018-10-15 12:28:08,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:28:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-15 12:28:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 424. [2018-10-15 12:28:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-15 12:28:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 425 transitions. [2018-10-15 12:28:08,550 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 425 transitions. Word has length 409 [2018-10-15 12:28:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:08,550 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 425 transitions. [2018-10-15 12:28:08,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:28:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 425 transitions. [2018-10-15 12:28:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:28:08,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:08,553 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:08,553 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:08,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash 766277476, now seen corresponding path program 39 times [2018-10-15 12:28:08,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7449 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:10,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:10,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:28:10,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:28:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:28:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:28:10,598 INFO L87 Difference]: Start difference. First operand 424 states and 425 transitions. Second operand 81 states. [2018-10-15 12:28:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:14,269 INFO L93 Difference]: Finished difference Result 457 states and 458 transitions. [2018-10-15 12:28:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:28:14,269 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 419 [2018-10-15 12:28:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:14,272 INFO L225 Difference]: With dead ends: 457 [2018-10-15 12:28:14,272 INFO L226 Difference]: Without dead ends: 457 [2018-10-15 12:28:14,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:28:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-15 12:28:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 434. [2018-10-15 12:28:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:28:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-10-15 12:28:14,277 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 419 [2018-10-15 12:28:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:14,278 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-10-15 12:28:14,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:28:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-10-15 12:28:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:28:14,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:14,280 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:14,280 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:14,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:14,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1757754399, now seen corresponding path program 40 times [2018-10-15 12:28:14,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:16,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:16,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:28:16,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:28:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:28:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:28:16,454 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 83 states. [2018-10-15 12:28:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:20,170 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-10-15 12:28:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:28:20,171 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 429 [2018-10-15 12:28:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:20,173 INFO L225 Difference]: With dead ends: 467 [2018-10-15 12:28:20,173 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 12:28:20,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:28:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 12:28:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 444. [2018-10-15 12:28:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-15 12:28:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 445 transitions. [2018-10-15 12:28:20,179 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 445 transitions. Word has length 429 [2018-10-15 12:28:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:20,179 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 445 transitions. [2018-10-15 12:28:20,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:28:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 445 transitions. [2018-10-15 12:28:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 12:28:20,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:20,182 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:20,182 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:20,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1546748698, now seen corresponding path program 41 times [2018-10-15 12:28:20,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8241 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:22,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:22,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:28:22,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:28:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:28:22,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:28:22,380 INFO L87 Difference]: Start difference. First operand 444 states and 445 transitions. Second operand 85 states. [2018-10-15 12:28:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:26,252 INFO L93 Difference]: Finished difference Result 477 states and 478 transitions. [2018-10-15 12:28:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:28:26,253 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 439 [2018-10-15 12:28:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:26,255 INFO L225 Difference]: With dead ends: 477 [2018-10-15 12:28:26,255 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 12:28:26,257 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:28:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 12:28:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 454. [2018-10-15 12:28:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-10-15 12:28:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 455 transitions. [2018-10-15 12:28:26,261 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 455 transitions. Word has length 439 [2018-10-15 12:28:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:26,261 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 455 transitions. [2018-10-15 12:28:26,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:28:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 455 transitions. [2018-10-15 12:28:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 12:28:26,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:26,263 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:26,263 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:26,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1555065771, now seen corresponding path program 42 times [2018-10-15 12:28:26,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8652 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:28,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:28:28,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:28:28,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:28:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:28:28,742 INFO L87 Difference]: Start difference. First operand 454 states and 455 transitions. Second operand 87 states. [2018-10-15 12:28:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:32,933 INFO L93 Difference]: Finished difference Result 487 states and 488 transitions. [2018-10-15 12:28:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:28:32,934 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 449 [2018-10-15 12:28:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:32,936 INFO L225 Difference]: With dead ends: 487 [2018-10-15 12:28:32,937 INFO L226 Difference]: Without dead ends: 487 [2018-10-15 12:28:32,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:28:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-10-15 12:28:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 464. [2018-10-15 12:28:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 12:28:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 465 transitions. [2018-10-15 12:28:32,944 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 465 transitions. Word has length 449 [2018-10-15 12:28:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:32,944 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 465 transitions. [2018-10-15 12:28:32,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:28:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 465 transitions. [2018-10-15 12:28:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 12:28:32,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:32,947 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:32,947 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:32,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1652451376, now seen corresponding path program 43 times [2018-10-15 12:28:32,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:35,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:35,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:28:35,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:28:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:28:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:28:35,858 INFO L87 Difference]: Start difference. First operand 464 states and 465 transitions. Second operand 89 states. [2018-10-15 12:28:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:40,426 INFO L93 Difference]: Finished difference Result 497 states and 498 transitions. [2018-10-15 12:28:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:28:40,426 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 459 [2018-10-15 12:28:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:40,428 INFO L225 Difference]: With dead ends: 497 [2018-10-15 12:28:40,428 INFO L226 Difference]: Without dead ends: 497 [2018-10-15 12:28:40,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:28:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-15 12:28:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 474. [2018-10-15 12:28:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-15 12:28:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2018-10-15 12:28:40,434 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 459 [2018-10-15 12:28:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:40,435 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 475 transitions. [2018-10-15 12:28:40,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:28:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 475 transitions. [2018-10-15 12:28:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:28:40,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:40,438 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:40,438 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:40,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 959298955, now seen corresponding path program 44 times [2018-10-15 12:28:40,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:43,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:43,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:28:43,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:28:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:28:43,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:28:43,127 INFO L87 Difference]: Start difference. First operand 474 states and 475 transitions. Second operand 91 states. [2018-10-15 12:28:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:47,742 INFO L93 Difference]: Finished difference Result 507 states and 508 transitions. [2018-10-15 12:28:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:28:47,743 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 469 [2018-10-15 12:28:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:47,746 INFO L225 Difference]: With dead ends: 507 [2018-10-15 12:28:47,746 INFO L226 Difference]: Without dead ends: 507 [2018-10-15 12:28:47,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:28:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-15 12:28:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 484. [2018-10-15 12:28:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-15 12:28:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 485 transitions. [2018-10-15 12:28:47,750 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 485 transitions. Word has length 469 [2018-10-15 12:28:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:47,751 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 485 transitions. [2018-10-15 12:28:47,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:28:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 485 transitions. [2018-10-15 12:28:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:28:47,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:47,754 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:47,754 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:47,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:47,754 INFO L82 PathProgramCache]: Analyzing trace with hash -21088890, now seen corresponding path program 45 times [2018-10-15 12:28:47,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9945 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:50,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:50,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:28:50,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:28:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:28:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:28:50,592 INFO L87 Difference]: Start difference. First operand 484 states and 485 transitions. Second operand 93 states. [2018-10-15 12:28:55,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:55,358 INFO L93 Difference]: Finished difference Result 517 states and 518 transitions. [2018-10-15 12:28:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:28:55,359 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 479 [2018-10-15 12:28:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:55,361 INFO L225 Difference]: With dead ends: 517 [2018-10-15 12:28:55,361 INFO L226 Difference]: Without dead ends: 517 [2018-10-15 12:28:55,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:28:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-10-15 12:28:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 494. [2018-10-15 12:28:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-10-15 12:28:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 495 transitions. [2018-10-15 12:28:55,366 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 495 transitions. Word has length 479 [2018-10-15 12:28:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:55,366 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 495 transitions. [2018-10-15 12:28:55,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:28:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 495 transitions. [2018-10-15 12:28:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 12:28:55,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:55,368 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:55,369 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:55,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1537290177, now seen corresponding path program 46 times [2018-10-15 12:28:55,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10396 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:28:58,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:28:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:28:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:28:58,122 INFO L87 Difference]: Start difference. First operand 494 states and 495 transitions. Second operand 95 states. [2018-10-15 12:29:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:03,141 INFO L93 Difference]: Finished difference Result 527 states and 528 transitions. [2018-10-15 12:29:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:29:03,141 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 489 [2018-10-15 12:29:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:03,143 INFO L225 Difference]: With dead ends: 527 [2018-10-15 12:29:03,143 INFO L226 Difference]: Without dead ends: 527 [2018-10-15 12:29:03,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:29:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-15 12:29:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 504. [2018-10-15 12:29:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-15 12:29:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2018-10-15 12:29:03,149 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 489 [2018-10-15 12:29:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:03,149 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2018-10-15 12:29:03,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:29:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2018-10-15 12:29:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:29:03,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:03,152 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:03,153 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:03,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 759749692, now seen corresponding path program 47 times [2018-10-15 12:29:03,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:06,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:06,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:29:06,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:29:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:29:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:29:06,429 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 97 states. [2018-10-15 12:29:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:12,108 INFO L93 Difference]: Finished difference Result 537 states and 538 transitions. [2018-10-15 12:29:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:29:12,109 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 499 [2018-10-15 12:29:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:12,110 INFO L225 Difference]: With dead ends: 537 [2018-10-15 12:29:12,111 INFO L226 Difference]: Without dead ends: 537 [2018-10-15 12:29:12,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:29:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-15 12:29:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 514. [2018-10-15 12:29:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-10-15 12:29:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 515 transitions. [2018-10-15 12:29:12,117 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 515 transitions. Word has length 499 [2018-10-15 12:29:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:12,117 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 515 transitions. [2018-10-15 12:29:12,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:29:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 515 transitions. [2018-10-15 12:29:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:29:12,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:12,120 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:12,120 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:12,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1943311625, now seen corresponding path program 48 times [2018-10-15 12:29:12,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11328 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:15,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:15,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:29:15,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:29:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:29:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:29:15,271 INFO L87 Difference]: Start difference. First operand 514 states and 515 transitions. Second operand 99 states. [2018-10-15 12:29:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:20,759 INFO L93 Difference]: Finished difference Result 547 states and 548 transitions. [2018-10-15 12:29:20,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:29:20,760 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 509 [2018-10-15 12:29:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:20,762 INFO L225 Difference]: With dead ends: 547 [2018-10-15 12:29:20,762 INFO L226 Difference]: Without dead ends: 547 [2018-10-15 12:29:20,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:29:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-15 12:29:20,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 524. [2018-10-15 12:29:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 12:29:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 525 transitions. [2018-10-15 12:29:20,768 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 525 transitions. Word has length 509 [2018-10-15 12:29:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:20,768 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 525 transitions. [2018-10-15 12:29:20,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:29:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 525 transitions. [2018-10-15 12:29:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 12:29:20,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:20,771 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:20,771 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:20,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -691860494, now seen corresponding path program 49 times [2018-10-15 12:29:20,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11809 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:23,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:23,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:29:23,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:29:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:29:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:29:23,899 INFO L87 Difference]: Start difference. First operand 524 states and 525 transitions. Second operand 101 states. [2018-10-15 12:29:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:29,485 INFO L93 Difference]: Finished difference Result 557 states and 558 transitions. [2018-10-15 12:29:29,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:29:29,485 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 519 [2018-10-15 12:29:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:29,487 INFO L225 Difference]: With dead ends: 557 [2018-10-15 12:29:29,487 INFO L226 Difference]: Without dead ends: 557 [2018-10-15 12:29:29,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:29:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-10-15 12:29:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 534. [2018-10-15 12:29:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-10-15 12:29:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 535 transitions. [2018-10-15 12:29:29,495 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 535 transitions. Word has length 519 [2018-10-15 12:29:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:29,496 INFO L481 AbstractCegarLoop]: Abstraction has 534 states and 535 transitions. [2018-10-15 12:29:29,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:29:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 535 transitions. [2018-10-15 12:29:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 12:29:29,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:29,499 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:29,499 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:29,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -57807059, now seen corresponding path program 50 times [2018-10-15 12:29:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12300 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:33,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:33,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:29:33,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:29:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:29:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:29:33,210 INFO L87 Difference]: Start difference. First operand 534 states and 535 transitions. Second operand 103 states. [2018-10-15 12:29:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:38,936 INFO L93 Difference]: Finished difference Result 567 states and 568 transitions. [2018-10-15 12:29:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:29:38,936 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 529 [2018-10-15 12:29:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:38,939 INFO L225 Difference]: With dead ends: 567 [2018-10-15 12:29:38,939 INFO L226 Difference]: Without dead ends: 567 [2018-10-15 12:29:38,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:29:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-15 12:29:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 544. [2018-10-15 12:29:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-15 12:29:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 545 transitions. [2018-10-15 12:29:38,945 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 545 transitions. Word has length 529 [2018-10-15 12:29:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:38,946 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 545 transitions. [2018-10-15 12:29:38,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:29:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 545 transitions. [2018-10-15 12:29:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 12:29:38,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:38,949 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:38,949 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:38,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash 151930024, now seen corresponding path program 51 times [2018-10-15 12:29:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12801 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:42,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:29:42,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:29:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:29:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:29:42,448 INFO L87 Difference]: Start difference. First operand 544 states and 545 transitions. Second operand 105 states. [2018-10-15 12:29:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:48,638 INFO L93 Difference]: Finished difference Result 577 states and 578 transitions. [2018-10-15 12:29:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:29:48,639 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 539 [2018-10-15 12:29:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:48,641 INFO L225 Difference]: With dead ends: 577 [2018-10-15 12:29:48,641 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 12:29:48,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:29:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 12:29:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 554. [2018-10-15 12:29:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-15 12:29:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 555 transitions. [2018-10-15 12:29:48,647 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 555 transitions. Word has length 539 [2018-10-15 12:29:48,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:48,647 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 555 transitions. [2018-10-15 12:29:48,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:29:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 555 transitions. [2018-10-15 12:29:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 12:29:48,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:48,650 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:48,650 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:48,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:48,650 INFO L82 PathProgramCache]: Analyzing trace with hash -288736157, now seen corresponding path program 52 times [2018-10-15 12:29:48,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13312 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:52,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:52,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:29:52,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:29:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:29:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:29:52,252 INFO L87 Difference]: Start difference. First operand 554 states and 555 transitions. Second operand 107 states. [2018-10-15 12:29:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:58,672 INFO L93 Difference]: Finished difference Result 587 states and 588 transitions. [2018-10-15 12:29:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:29:58,673 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 549 [2018-10-15 12:29:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:58,675 INFO L225 Difference]: With dead ends: 587 [2018-10-15 12:29:58,676 INFO L226 Difference]: Without dead ends: 587 [2018-10-15 12:29:58,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:29:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-15 12:29:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 564. [2018-10-15 12:29:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-10-15 12:29:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 565 transitions. [2018-10-15 12:29:58,684 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 565 transitions. Word has length 549 [2018-10-15 12:29:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:58,685 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 565 transitions. [2018-10-15 12:29:58,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:29:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 565 transitions. [2018-10-15 12:29:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:29:58,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:58,688 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:58,688 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:58,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1840511394, now seen corresponding path program 53 times [2018-10-15 12:29:58,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:02,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:02,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:30:02,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:30:02,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:30:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:30:02,461 INFO L87 Difference]: Start difference. First operand 564 states and 565 transitions. Second operand 109 states. [2018-10-15 12:30:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:08,809 INFO L93 Difference]: Finished difference Result 597 states and 598 transitions. [2018-10-15 12:30:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:30:08,810 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 559 [2018-10-15 12:30:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:08,812 INFO L225 Difference]: With dead ends: 597 [2018-10-15 12:30:08,813 INFO L226 Difference]: Without dead ends: 597 [2018-10-15 12:30:08,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:30:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-15 12:30:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 574. [2018-10-15 12:30:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-10-15 12:30:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2018-10-15 12:30:08,819 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 559 [2018-10-15 12:30:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:08,820 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2018-10-15 12:30:08,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:30:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2018-10-15 12:30:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 12:30:08,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:08,822 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:08,822 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:08,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 354538137, now seen corresponding path program 54 times [2018-10-15 12:30:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14364 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:12,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:12,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:30:12,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:30:12,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:30:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:30:12,743 INFO L87 Difference]: Start difference. First operand 574 states and 575 transitions. Second operand 111 states. [2018-10-15 12:30:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:19,201 INFO L93 Difference]: Finished difference Result 607 states and 608 transitions. [2018-10-15 12:30:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:30:19,202 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 569 [2018-10-15 12:30:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:19,205 INFO L225 Difference]: With dead ends: 607 [2018-10-15 12:30:19,205 INFO L226 Difference]: Without dead ends: 607 [2018-10-15 12:30:19,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:30:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-15 12:30:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 584. [2018-10-15 12:30:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-10-15 12:30:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 585 transitions. [2018-10-15 12:30:19,211 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 585 transitions. Word has length 569 [2018-10-15 12:30:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:19,211 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 585 transitions. [2018-10-15 12:30:19,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:30:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 585 transitions. [2018-10-15 12:30:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 12:30:19,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:19,214 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:19,214 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:19,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1625149716, now seen corresponding path program 55 times [2018-10-15 12:30:19,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14905 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:23,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:23,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:30:23,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:30:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:30:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:30:23,228 INFO L87 Difference]: Start difference. First operand 584 states and 585 transitions. Second operand 113 states. [2018-10-15 12:30:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:30,564 INFO L93 Difference]: Finished difference Result 617 states and 618 transitions. [2018-10-15 12:30:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:30:30,564 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 579 [2018-10-15 12:30:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:30,566 INFO L225 Difference]: With dead ends: 617 [2018-10-15 12:30:30,566 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 12:30:30,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:30:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 12:30:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 594. [2018-10-15 12:30:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-15 12:30:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 595 transitions. [2018-10-15 12:30:30,572 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 595 transitions. Word has length 579 [2018-10-15 12:30:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:30,572 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 595 transitions. [2018-10-15 12:30:30,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:30:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 595 transitions. [2018-10-15 12:30:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:30:30,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:30,575 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:30,575 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:30,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash -233426481, now seen corresponding path program 56 times [2018-10-15 12:30:30,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15456 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:34,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:34,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:30:34,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:30:34,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:30:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:30:34,891 INFO L87 Difference]: Start difference. First operand 594 states and 595 transitions. Second operand 115 states. [2018-10-15 12:30:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:42,474 INFO L93 Difference]: Finished difference Result 627 states and 628 transitions. [2018-10-15 12:30:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:30:42,474 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 589 [2018-10-15 12:30:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:42,476 INFO L225 Difference]: With dead ends: 627 [2018-10-15 12:30:42,476 INFO L226 Difference]: Without dead ends: 627 [2018-10-15 12:30:42,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:30:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-15 12:30:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 604. [2018-10-15 12:30:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-15 12:30:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 605 transitions. [2018-10-15 12:30:42,482 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 605 transitions. Word has length 589 [2018-10-15 12:30:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:42,482 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 605 transitions. [2018-10-15 12:30:42,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:30:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 605 transitions. [2018-10-15 12:30:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:30:42,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:42,485 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:42,486 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:42,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash -479910710, now seen corresponding path program 57 times [2018-10-15 12:30:42,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16017 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:30:46,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:30:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:30:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:30:46,436 INFO L87 Difference]: Start difference. First operand 604 states and 605 transitions. Second operand 117 states. [2018-10-15 12:30:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:53,655 INFO L93 Difference]: Finished difference Result 637 states and 638 transitions. [2018-10-15 12:30:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:30:53,656 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 599 [2018-10-15 12:30:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:53,659 INFO L225 Difference]: With dead ends: 637 [2018-10-15 12:30:53,659 INFO L226 Difference]: Without dead ends: 637 [2018-10-15 12:30:53,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:30:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-10-15 12:30:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 614. [2018-10-15 12:30:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-15 12:30:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 615 transitions. [2018-10-15 12:30:53,665 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 615 transitions. Word has length 599 [2018-10-15 12:30:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:53,666 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 615 transitions. [2018-10-15 12:30:53,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:30:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 615 transitions. [2018-10-15 12:30:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 12:30:53,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:53,669 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:53,669 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:53,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:53,669 INFO L82 PathProgramCache]: Analyzing trace with hash 946395653, now seen corresponding path program 58 times [2018-10-15 12:30:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16588 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:57,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:57,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:30:57,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:30:57,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:30:57,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:30:57,984 INFO L87 Difference]: Start difference. First operand 614 states and 615 transitions. Second operand 119 states. [2018-10-15 12:31:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:05,528 INFO L93 Difference]: Finished difference Result 647 states and 648 transitions. [2018-10-15 12:31:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:31:05,528 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 609 [2018-10-15 12:31:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:05,530 INFO L225 Difference]: With dead ends: 647 [2018-10-15 12:31:05,531 INFO L226 Difference]: Without dead ends: 647 [2018-10-15 12:31:05,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:31:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-10-15 12:31:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 624. [2018-10-15 12:31:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-15 12:31:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 625 transitions. [2018-10-15 12:31:05,536 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 625 transitions. Word has length 609 [2018-10-15 12:31:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:05,537 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 625 transitions. [2018-10-15 12:31:05,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:31:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 625 transitions. [2018-10-15 12:31:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 12:31:05,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:05,540 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:05,540 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:05,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1757643136, now seen corresponding path program 59 times [2018-10-15 12:31:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17169 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:10,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:10,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:31:10,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:31:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:31:10,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:31:10,108 INFO L87 Difference]: Start difference. First operand 624 states and 625 transitions. Second operand 121 states. [2018-10-15 12:31:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:18,167 INFO L93 Difference]: Finished difference Result 657 states and 658 transitions. [2018-10-15 12:31:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 12:31:18,167 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 619 [2018-10-15 12:31:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:18,169 INFO L225 Difference]: With dead ends: 657 [2018-10-15 12:31:18,169 INFO L226 Difference]: Without dead ends: 657 [2018-10-15 12:31:18,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 12:31:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-15 12:31:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 634. [2018-10-15 12:31:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-15 12:31:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 635 transitions. [2018-10-15 12:31:18,175 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 635 transitions. Word has length 619 [2018-10-15 12:31:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:18,175 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 635 transitions. [2018-10-15 12:31:18,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:31:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 635 transitions. [2018-10-15 12:31:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 12:31:18,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:18,179 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:18,179 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:18,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 723209019, now seen corresponding path program 60 times [2018-10-15 12:31:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17760 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:22,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:22,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:31:22,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:31:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:31:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:31:22,526 INFO L87 Difference]: Start difference. First operand 634 states and 635 transitions. Second operand 123 states. [2018-10-15 12:31:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:30,478 INFO L93 Difference]: Finished difference Result 667 states and 668 transitions. [2018-10-15 12:31:30,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 12:31:30,478 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 629 [2018-10-15 12:31:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:30,481 INFO L225 Difference]: With dead ends: 667 [2018-10-15 12:31:30,481 INFO L226 Difference]: Without dead ends: 667 [2018-10-15 12:31:30,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 12:31:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-10-15 12:31:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 644. [2018-10-15 12:31:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-10-15 12:31:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 645 transitions. [2018-10-15 12:31:30,486 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 645 transitions. Word has length 629 [2018-10-15 12:31:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:30,487 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 645 transitions. [2018-10-15 12:31:30,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:31:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 645 transitions. [2018-10-15 12:31:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 12:31:30,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:30,490 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:30,490 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:30,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2145753290, now seen corresponding path program 61 times [2018-10-15 12:31:30,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:35,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:35,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:31:35,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:31:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:31:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:31:35,261 INFO L87 Difference]: Start difference. First operand 644 states and 645 transitions. Second operand 125 states. [2018-10-15 12:31:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:43,839 INFO L93 Difference]: Finished difference Result 677 states and 678 transitions. [2018-10-15 12:31:43,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 12:31:43,839 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 639 [2018-10-15 12:31:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:43,842 INFO L225 Difference]: With dead ends: 677 [2018-10-15 12:31:43,842 INFO L226 Difference]: Without dead ends: 677 [2018-10-15 12:31:43,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 12:31:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-10-15 12:31:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 654. [2018-10-15 12:31:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-15 12:31:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 655 transitions. [2018-10-15 12:31:43,848 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 655 transitions. Word has length 639 [2018-10-15 12:31:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:43,849 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 655 transitions. [2018-10-15 12:31:43,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:31:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 655 transitions. [2018-10-15 12:31:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 12:31:43,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:43,852 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:43,852 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:43,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -43055759, now seen corresponding path program 62 times [2018-10-15 12:31:43,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18972 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:48,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:48,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:31:48,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:31:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:31:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:31:48,566 INFO L87 Difference]: Start difference. First operand 654 states and 655 transitions. Second operand 127 states. [2018-10-15 12:31:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:57,147 INFO L93 Difference]: Finished difference Result 687 states and 688 transitions. [2018-10-15 12:31:57,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 12:31:57,148 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 649 [2018-10-15 12:31:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:57,150 INFO L225 Difference]: With dead ends: 687 [2018-10-15 12:31:57,150 INFO L226 Difference]: Without dead ends: 687 [2018-10-15 12:31:57,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 12:31:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-15 12:31:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 664. [2018-10-15 12:31:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-15 12:31:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 665 transitions. [2018-10-15 12:31:57,156 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 665 transitions. Word has length 649 [2018-10-15 12:31:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:57,156 INFO L481 AbstractCegarLoop]: Abstraction has 664 states and 665 transitions. [2018-10-15 12:31:57,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:31:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 665 transitions. [2018-10-15 12:31:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 12:31:57,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:57,160 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:57,160 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:57,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1489720812, now seen corresponding path program 63 times [2018-10-15 12:31:57,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19593 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:02,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:02,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:32:02,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:32:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:32:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:32:02,167 INFO L87 Difference]: Start difference. First operand 664 states and 665 transitions. Second operand 129 states. [2018-10-15 12:32:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:10,579 INFO L93 Difference]: Finished difference Result 697 states and 698 transitions. [2018-10-15 12:32:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 12:32:10,580 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 659 [2018-10-15 12:32:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:10,583 INFO L225 Difference]: With dead ends: 697 [2018-10-15 12:32:10,583 INFO L226 Difference]: Without dead ends: 697 [2018-10-15 12:32:10,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 12:32:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2018-10-15 12:32:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 674. [2018-10-15 12:32:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2018-10-15 12:32:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 675 transitions. [2018-10-15 12:32:10,590 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 675 transitions. Word has length 659 [2018-10-15 12:32:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:10,590 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 675 transitions. [2018-10-15 12:32:10,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:32:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 675 transitions. [2018-10-15 12:32:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 12:32:10,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:10,594 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:10,594 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:10,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash 853903527, now seen corresponding path program 64 times [2018-10-15 12:32:10,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20224 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:15,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:15,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:32:15,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:32:15,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:32:15,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:32:15,803 INFO L87 Difference]: Start difference. First operand 674 states and 675 transitions. Second operand 131 states. [2018-10-15 12:32:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:25,386 INFO L93 Difference]: Finished difference Result 707 states and 708 transitions. [2018-10-15 12:32:25,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 12:32:25,387 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 669 [2018-10-15 12:32:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:25,389 INFO L225 Difference]: With dead ends: 707 [2018-10-15 12:32:25,389 INFO L226 Difference]: Without dead ends: 707 [2018-10-15 12:32:25,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 12:32:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-10-15 12:32:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 684. [2018-10-15 12:32:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-10-15 12:32:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 685 transitions. [2018-10-15 12:32:25,396 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 685 transitions. Word has length 669 [2018-10-15 12:32:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:25,396 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 685 transitions. [2018-10-15 12:32:25,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:32:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 685 transitions. [2018-10-15 12:32:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 12:32:25,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:25,400 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:25,400 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:25,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash 578276770, now seen corresponding path program 65 times [2018-10-15 12:32:25,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20865 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:30,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:30,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:32:30,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:32:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:32:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:32:30,736 INFO L87 Difference]: Start difference. First operand 684 states and 685 transitions. Second operand 133 states. [2018-10-15 12:32:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:40,455 INFO L93 Difference]: Finished difference Result 717 states and 718 transitions. [2018-10-15 12:32:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 12:32:40,456 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 679 [2018-10-15 12:32:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:40,458 INFO L225 Difference]: With dead ends: 717 [2018-10-15 12:32:40,458 INFO L226 Difference]: Without dead ends: 717 [2018-10-15 12:32:40,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:32:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-15 12:32:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 694. [2018-10-15 12:32:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-15 12:32:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 695 transitions. [2018-10-15 12:32:40,464 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 695 transitions. Word has length 679 [2018-10-15 12:32:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:40,465 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 695 transitions. [2018-10-15 12:32:40,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:32:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 695 transitions. [2018-10-15 12:32:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 12:32:40,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:40,468 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:40,468 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:40,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:40,469 INFO L82 PathProgramCache]: Analyzing trace with hash -12561187, now seen corresponding path program 66 times [2018-10-15 12:32:40,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21516 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:46,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:46,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:32:46,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:32:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:32:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:32:46,221 INFO L87 Difference]: Start difference. First operand 694 states and 695 transitions. Second operand 135 states. [2018-10-15 12:32:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:56,293 INFO L93 Difference]: Finished difference Result 727 states and 728 transitions. [2018-10-15 12:32:56,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 12:32:56,294 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 689 [2018-10-15 12:32:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:56,296 INFO L225 Difference]: With dead ends: 727 [2018-10-15 12:32:56,296 INFO L226 Difference]: Without dead ends: 727 [2018-10-15 12:32:56,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 12:32:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-15 12:32:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 704. [2018-10-15 12:32:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-10-15 12:32:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 705 transitions. [2018-10-15 12:32:56,302 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 705 transitions. Word has length 689 [2018-10-15 12:32:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:56,303 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 705 transitions. [2018-10-15 12:32:56,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:32:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 705 transitions. [2018-10-15 12:32:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 12:32:56,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:56,306 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:56,307 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:56,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1828802136, now seen corresponding path program 67 times [2018-10-15 12:32:56,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22177 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:02,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:02,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:33:02,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:33:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:33:02,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:33:02,141 INFO L87 Difference]: Start difference. First operand 704 states and 705 transitions. Second operand 137 states. [2018-10-15 12:33:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:11,859 INFO L93 Difference]: Finished difference Result 737 states and 738 transitions. [2018-10-15 12:33:11,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 12:33:11,859 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 699 [2018-10-15 12:33:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:11,862 INFO L225 Difference]: With dead ends: 737 [2018-10-15 12:33:11,862 INFO L226 Difference]: Without dead ends: 737 [2018-10-15 12:33:11,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 12:33:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-10-15 12:33:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 714. [2018-10-15 12:33:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-10-15 12:33:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 715 transitions. [2018-10-15 12:33:11,869 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 715 transitions. Word has length 699 [2018-10-15 12:33:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:11,869 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 715 transitions. [2018-10-15 12:33:11,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:33:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 715 transitions. [2018-10-15 12:33:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 12:33:11,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:11,874 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:11,874 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:11,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1501500909, now seen corresponding path program 68 times [2018-10-15 12:33:11,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22848 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:17,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:17,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:33:17,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:33:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:33:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:33:17,659 INFO L87 Difference]: Start difference. First operand 714 states and 715 transitions. Second operand 139 states. [2018-10-15 12:33:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:28,026 INFO L93 Difference]: Finished difference Result 747 states and 748 transitions. [2018-10-15 12:33:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 12:33:28,027 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 709 [2018-10-15 12:33:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:28,029 INFO L225 Difference]: With dead ends: 747 [2018-10-15 12:33:28,029 INFO L226 Difference]: Without dead ends: 747 [2018-10-15 12:33:28,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:33:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-10-15 12:33:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 724. [2018-10-15 12:33:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-15 12:33:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 725 transitions. [2018-10-15 12:33:28,035 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 725 transitions. Word has length 709 [2018-10-15 12:33:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:28,036 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 725 transitions. [2018-10-15 12:33:28,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:33:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 725 transitions. [2018-10-15 12:33:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 12:33:28,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:28,040 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:28,040 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:28,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2004264946, now seen corresponding path program 69 times [2018-10-15 12:33:28,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 23529 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:34,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:34,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 12:33:34,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 12:33:34,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 12:33:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 12:33:34,036 INFO L87 Difference]: Start difference. First operand 724 states and 725 transitions. Second operand 141 states. [2018-10-15 12:33:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:44,708 INFO L93 Difference]: Finished difference Result 757 states and 758 transitions. [2018-10-15 12:33:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 12:33:44,709 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 719 [2018-10-15 12:33:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:44,713 INFO L225 Difference]: With dead ends: 757 [2018-10-15 12:33:44,713 INFO L226 Difference]: Without dead ends: 757 [2018-10-15 12:33:44,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 12:33:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-15 12:33:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 734. [2018-10-15 12:33:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-10-15 12:33:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 735 transitions. [2018-10-15 12:33:44,720 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 735 transitions. Word has length 719 [2018-10-15 12:33:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:44,721 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 735 transitions. [2018-10-15 12:33:44,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 12:33:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 735 transitions. [2018-10-15 12:33:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 12:33:44,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:44,724 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:44,725 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:44,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:44,725 INFO L82 PathProgramCache]: Analyzing trace with hash -588724151, now seen corresponding path program 70 times [2018-10-15 12:33:44,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 24220 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:51,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:33:51,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:33:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:33:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:33:51,048 INFO L87 Difference]: Start difference. First operand 734 states and 735 transitions. Second operand 143 states. [2018-10-15 12:34:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:01,704 INFO L93 Difference]: Finished difference Result 767 states and 768 transitions. [2018-10-15 12:34:01,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:34:01,704 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 729 [2018-10-15 12:34:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:01,707 INFO L225 Difference]: With dead ends: 767 [2018-10-15 12:34:01,707 INFO L226 Difference]: Without dead ends: 767 [2018-10-15 12:34:01,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 12:34:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-10-15 12:34:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 744. [2018-10-15 12:34:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-10-15 12:34:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 745 transitions. [2018-10-15 12:34:01,714 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 745 transitions. Word has length 729 [2018-10-15 12:34:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:01,714 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 745 transitions. [2018-10-15 12:34:01,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:34:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 745 transitions. [2018-10-15 12:34:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 12:34:01,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:01,718 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:01,718 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:01,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash -445551932, now seen corresponding path program 71 times [2018-10-15 12:34:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24921 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:08,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:08,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 12:34:08,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 12:34:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 12:34:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:34:08,077 INFO L87 Difference]: Start difference. First operand 744 states and 745 transitions. Second operand 145 states. [2018-10-15 12:34:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:19,448 INFO L93 Difference]: Finished difference Result 777 states and 778 transitions. [2018-10-15 12:34:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 12:34:19,448 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 739 [2018-10-15 12:34:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:19,451 INFO L225 Difference]: With dead ends: 777 [2018-10-15 12:34:19,451 INFO L226 Difference]: Without dead ends: 777 [2018-10-15 12:34:19,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 12:34:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-10-15 12:34:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 754. [2018-10-15 12:34:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-10-15 12:34:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 755 transitions. [2018-10-15 12:34:19,459 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 755 transitions. Word has length 739 [2018-10-15 12:34:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:19,460 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 755 transitions. [2018-10-15 12:34:19,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 12:34:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 755 transitions. [2018-10-15 12:34:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 12:34:19,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:19,464 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:19,464 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:19,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash 653881215, now seen corresponding path program 72 times [2018-10-15 12:34:19,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25632 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:25,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:25,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 12:34:25,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 12:34:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 12:34:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:34:25,995 INFO L87 Difference]: Start difference. First operand 754 states and 755 transitions. Second operand 147 states. [2018-10-15 12:34:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:38,105 INFO L93 Difference]: Finished difference Result 787 states and 788 transitions. [2018-10-15 12:34:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 12:34:38,105 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 749 [2018-10-15 12:34:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:38,108 INFO L225 Difference]: With dead ends: 787 [2018-10-15 12:34:38,109 INFO L226 Difference]: Without dead ends: 787 [2018-10-15 12:34:38,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 12:34:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-10-15 12:34:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 764. [2018-10-15 12:34:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-10-15 12:34:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 765 transitions. [2018-10-15 12:34:38,118 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 765 transitions. Word has length 749 [2018-10-15 12:34:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:38,118 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 765 transitions. [2018-10-15 12:34:38,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 12:34:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 765 transitions. [2018-10-15 12:34:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-15 12:34:38,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:38,124 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:38,124 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:38,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1952122490, now seen corresponding path program 73 times [2018-10-15 12:34:38,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat