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/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:19:35,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:19:35,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:19:35,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:19:35,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:19:35,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:19:35,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:19:35,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:19:35,089 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:19:35,090 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:19:35,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:19:35,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:19:35,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:19:35,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:19:35,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:19:35,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:19:35,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:19:35,098 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:19:35,100 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:19:35,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:19:35,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:19:35,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:19:35,107 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:19:35,107 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:19:35,108 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:19:35,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:19:35,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:19:35,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:19:35,111 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:19:35,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:19:35,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:19:35,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:19:35,114 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:19:35,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:19:35,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:19:35,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:19:35,117 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-10 15:19:35,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:19:35,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:19:35,137 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:19:35,137 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:19:35,140 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:19:35,140 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:19:35,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:19:35,141 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:19:35,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:19:35,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:19:35,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:19:35,142 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:19:35,142 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:19:35,143 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:19:35,143 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:19:35,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:19:35,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:19:35,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:19:35,242 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:19:35,243 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:19:35,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2018-10-10 15:19:35,244 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl' [2018-10-10 15:19:35,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:19:35,333 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:19:35,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:19:35,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:19:35,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:19:35,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/1) ... [2018-10-10 15:19:35,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:19:35,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:19:35,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:19:35,407 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:19:35,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (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-10 15:19:35,483 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:19:35,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:19:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:19:36,121 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:19:36,122 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:19:36 BoogieIcfgContainer [2018-10-10 15:19:36,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:19:36,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:19:36,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:19:36,127 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:19:36,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:19:35" (1/2) ... [2018-10-10 15:19:36,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9c0ace and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:19:36, skipping insertion in model container [2018-10-10 15:19:36,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:19:36" (2/2) ... [2018-10-10 15:19:36,131 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2018-10-10 15:19:36,141 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:19:36,150 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:19:36,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:19:36,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:19:36,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:19:36,199 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:19:36,199 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:19:36,199 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:19:36,199 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:19:36,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:19:36,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:19:36,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:19:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 15:19:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 15:19:36,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:36,250 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, 1, 1, 1] [2018-10-10 15:19:36,252 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:36,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2040165820, now seen corresponding path program 1 times [2018-10-10 15:19:36,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:37,217 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-10 15:19:37,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:19:37,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 15:19:37,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:19:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:19:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:19:37,245 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 10 states. [2018-10-10 15:19:37,667 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 15:19:38,106 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 15:19:38,465 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 15:19:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:38,629 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-10 15:19:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:19:38,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-10-10 15:19:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:38,646 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:19:38,647 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:19:38,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:19:38,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:19:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 73. [2018-10-10 15:19:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-10 15:19:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-10-10 15:19:38,696 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 42 [2018-10-10 15:19:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:38,697 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-10-10 15:19:38,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:19:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-10-10 15:19:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 15:19:38,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:38,700 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:38,701 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:38,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1285196190, now seen corresponding path program 1 times [2018-10-10 15:19:38,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:39,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:39,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:19:39,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:19:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:19:39,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:19:39,174 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 12 states. [2018-10-10 15:19:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:40,653 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2018-10-10 15:19:40,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:19:40,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-10-10 15:19:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:40,660 INFO L225 Difference]: With dead ends: 189 [2018-10-10 15:19:40,660 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 15:19:40,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:19:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 15:19:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 88. [2018-10-10 15:19:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-10 15:19:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-10-10 15:19:40,673 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 57 [2018-10-10 15:19:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:40,673 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-10-10 15:19:40,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:19:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-10-10 15:19:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 15:19:40,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:40,677 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:40,677 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:40,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash -265811324, now seen corresponding path program 2 times [2018-10-10 15:19:40,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:40,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:19:40,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:19:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:19:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:19:40,920 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 10 states. [2018-10-10 15:19:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:41,322 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-10-10 15:19:41,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:19:41,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-10-10 15:19:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:41,332 INFO L225 Difference]: With dead ends: 147 [2018-10-10 15:19:41,332 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 15:19:41,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:19:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 15:19:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2018-10-10 15:19:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 15:19:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-10-10 15:19:41,349 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 72 [2018-10-10 15:19:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:41,350 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-10-10 15:19:41,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:19:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-10-10 15:19:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 15:19:41,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:41,354 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:41,355 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:41,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1218697110, now seen corresponding path program 1 times [2018-10-10 15:19:41,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-10 15:19:41,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:41,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:19:41,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:19:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:19:41,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:19:41,654 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 8 states. [2018-10-10 15:19:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:41,804 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-10 15:19:41,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:19:41,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2018-10-10 15:19:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:41,815 INFO L225 Difference]: With dead ends: 147 [2018-10-10 15:19:41,815 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 15:19:41,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:19:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 15:19:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2018-10-10 15:19:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 15:19:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-10-10 15:19:41,828 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 112 [2018-10-10 15:19:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:41,828 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-10-10 15:19:41,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:19:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-10-10 15:19:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 15:19:41,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:41,833 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:41,834 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:41,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash -356399820, now seen corresponding path program 2 times [2018-10-10 15:19:41,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-10 15:19:42,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:42,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:19:42,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:19:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:19:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:19:42,286 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 15 states. [2018-10-10 15:19:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:43,875 INFO L93 Difference]: Finished difference Result 259 states and 265 transitions. [2018-10-10 15:19:43,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:19:43,876 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-10-10 15:19:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:43,878 INFO L225 Difference]: With dead ends: 259 [2018-10-10 15:19:43,879 INFO L226 Difference]: Without dead ends: 259 [2018-10-10 15:19:43,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:19:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-10 15:19:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 143. [2018-10-10 15:19:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 15:19:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-10-10 15:19:43,888 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 127 [2018-10-10 15:19:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:43,889 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-10-10 15:19:43,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:19:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-10-10 15:19:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 15:19:43,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:43,892 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:43,892 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:43,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 277740914, now seen corresponding path program 3 times [2018-10-10 15:19:43,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 39 proven. 134 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 15:19:44,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:44,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:19:44,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:19:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:19:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:19:44,901 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 14 states. [2018-10-10 15:19:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:45,591 INFO L93 Difference]: Finished difference Result 251 states and 258 transitions. [2018-10-10 15:19:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:19:45,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-10-10 15:19:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:45,593 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:19:45,594 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:19:45,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:19:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:19:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2018-10-10 15:19:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:19:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 220 transitions. [2018-10-10 15:19:45,605 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 220 transitions. Word has length 142 [2018-10-10 15:19:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:45,605 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 220 transitions. [2018-10-10 15:19:45,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:19:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 220 transitions. [2018-10-10 15:19:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:19:45,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:45,608 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-10 15:19:45,609 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:45,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1498155038, now seen corresponding path program 4 times [2018-10-10 15:19:45,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 141 proven. 12 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-10 15:19:45,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:45,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:19:45,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:19:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:19:45,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:19:45,752 INFO L87 Difference]: Start difference. First operand 213 states and 220 transitions. Second operand 8 states. [2018-10-10 15:19:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:45,920 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2018-10-10 15:19:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:19:45,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2018-10-10 15:19:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:45,923 INFO L225 Difference]: With dead ends: 232 [2018-10-10 15:19:45,923 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 15:19:45,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:19:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 15:19:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-10 15:19:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:19:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 219 transitions. [2018-10-10 15:19:45,932 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 219 transitions. Word has length 167 [2018-10-10 15:19:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:45,932 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 219 transitions. [2018-10-10 15:19:45,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:19:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 219 transitions. [2018-10-10 15:19:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:19:45,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:45,936 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-10 15:19:45,936 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:45,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 682793504, now seen corresponding path program 5 times [2018-10-10 15:19:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 191 proven. 44 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-10 15:19:46,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:46,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:19:46,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:19:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:19:46,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:19:46,219 INFO L87 Difference]: Start difference. First operand 213 states and 219 transitions. Second operand 10 states. [2018-10-10 15:19:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:46,567 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-10-10 15:19:46,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:19:46,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-10-10 15:19:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:46,570 INFO L225 Difference]: With dead ends: 232 [2018-10-10 15:19:46,570 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 15:19:46,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:19:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 15:19:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-10 15:19:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:19:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2018-10-10 15:19:46,576 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 182 [2018-10-10 15:19:46,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:46,577 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2018-10-10 15:19:46,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:19:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2018-10-10 15:19:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:19:46,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:46,580 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-10 15:19:46,580 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:46,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1699777502, now seen corresponding path program 6 times [2018-10-10 15:19:46,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 241 proven. 91 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-10 15:19:46,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:46,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:19:46,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:19:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:19:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:19:46,786 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand 12 states. [2018-10-10 15:19:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:47,228 INFO L93 Difference]: Finished difference Result 232 states and 236 transitions. [2018-10-10 15:19:47,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:19:47,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 197 [2018-10-10 15:19:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:47,236 INFO L225 Difference]: With dead ends: 232 [2018-10-10 15:19:47,236 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 15:19:47,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:19:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 15:19:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-10 15:19:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:19:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-10-10 15:19:47,243 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 197 [2018-10-10 15:19:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:47,244 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-10-10 15:19:47,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:19:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-10-10 15:19:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:19:47,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:47,247 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-10 15:19:47,247 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:47,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1799820768, now seen corresponding path program 7 times [2018-10-10 15:19:47,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-10 15:19:47,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:47,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:19:47,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:19:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:19:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:19:47,723 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 17 states. [2018-10-10 15:19:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:49,680 INFO L93 Difference]: Finished difference Result 333 states and 342 transitions. [2018-10-10 15:19:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:19:49,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 212 [2018-10-10 15:19:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:49,684 INFO L225 Difference]: With dead ends: 333 [2018-10-10 15:19:49,685 INFO L226 Difference]: Without dead ends: 333 [2018-10-10 15:19:49,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=633, Invalid=1529, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:19:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-10 15:19:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 252. [2018-10-10 15:19:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:19:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2018-10-10 15:19:49,692 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 212 [2018-10-10 15:19:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:49,693 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2018-10-10 15:19:49,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:19:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2018-10-10 15:19:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-10 15:19:49,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:49,696 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-10 15:19:49,696 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:49,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash -918055116, now seen corresponding path program 8 times [2018-10-10 15:19:49,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 336 proven. 4 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-10 15:19:50,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:50,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:19:50,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:19:50,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:19:50,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:19:50,046 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 10 states. [2018-10-10 15:19:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:50,214 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2018-10-10 15:19:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:19:50,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2018-10-10 15:19:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:50,217 INFO L225 Difference]: With dead ends: 273 [2018-10-10 15:19:50,217 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 15:19:50,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:19:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 15:19:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 253. [2018-10-10 15:19:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-10 15:19:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 257 transitions. [2018-10-10 15:19:50,223 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 257 transitions. Word has length 237 [2018-10-10 15:19:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:50,224 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 257 transitions. [2018-10-10 15:19:50,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:19:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 257 transitions. [2018-10-10 15:19:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-10 15:19:50,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:50,226 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-10 15:19:50,226 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:50,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash 122039438, now seen corresponding path program 9 times [2018-10-10 15:19:50,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 463 proven. 5 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-10-10 15:19:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:19:50,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:19:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:19:50,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:19:50,601 INFO L87 Difference]: Start difference. First operand 253 states and 257 transitions. Second operand 11 states. [2018-10-10 15:19:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:50,843 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2018-10-10 15:19:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:19:50,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2018-10-10 15:19:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:50,845 INFO L225 Difference]: With dead ends: 288 [2018-10-10 15:19:50,845 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:19:50,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:19:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:19:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2018-10-10 15:19:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-10 15:19:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2018-10-10 15:19:50,852 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 252 [2018-10-10 15:19:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:50,852 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2018-10-10 15:19:50,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:19:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2018-10-10 15:19:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-10 15:19:50,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:50,854 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-10 15:19:50,854 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:50,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2131560460, now seen corresponding path program 10 times [2018-10-10 15:19:50,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 422 proven. 313 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-10 15:19:51,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:51,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:19:51,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:19:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:19:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:19:51,463 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 14 states. [2018-10-10 15:19:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:51,922 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-10-10 15:19:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:19:51,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2018-10-10 15:19:51,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:51,926 INFO L225 Difference]: With dead ends: 305 [2018-10-10 15:19:51,927 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 15:19:51,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:19:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 15:19:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-10-10 15:19:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 15:19:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2018-10-10 15:19:51,933 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 267 [2018-10-10 15:19:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:51,934 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 285 transitions. [2018-10-10 15:19:51,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:19:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 285 transitions. [2018-10-10 15:19:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 15:19:51,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:51,936 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-10 15:19:51,936 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:51,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2066402354, now seen corresponding path program 11 times [2018-10-10 15:19:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 29 proven. 857 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-10 15:19:52,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:52,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:19:52,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:19:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:19:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:19:52,642 INFO L87 Difference]: Start difference. First operand 283 states and 285 transitions. Second operand 21 states. [2018-10-10 15:19:55,171 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-10 15:19:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:57,204 INFO L93 Difference]: Finished difference Result 384 states and 387 transitions. [2018-10-10 15:19:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:19:57,205 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 282 [2018-10-10 15:19:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:57,207 INFO L225 Difference]: With dead ends: 384 [2018-10-10 15:19:57,207 INFO L226 Difference]: Without dead ends: 384 [2018-10-10 15:19:57,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1888, Invalid=5594, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:19:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-10 15:19:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 353. [2018-10-10 15:19:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-10 15:19:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 356 transitions. [2018-10-10 15:19:57,216 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 356 transitions. Word has length 282 [2018-10-10 15:19:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:57,216 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 356 transitions. [2018-10-10 15:19:57,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:19:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 356 transitions. [2018-10-10 15:19:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-10 15:19:57,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:57,219 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-10 15:19:57,219 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:57,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1909602108, now seen corresponding path program 12 times [2018-10-10 15:19:57,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 819 proven. 689 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-10 15:19:57,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:57,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:19:57,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:19:57,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:19:57,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:19:57,681 INFO L87 Difference]: Start difference. First operand 353 states and 356 transitions. Second operand 18 states. [2018-10-10 15:20:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:01,266 INFO L93 Difference]: Finished difference Result 407 states and 410 transitions. [2018-10-10 15:20:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:20:01,266 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-10-10 15:20:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:01,269 INFO L225 Difference]: With dead ends: 407 [2018-10-10 15:20:01,269 INFO L226 Difference]: Without dead ends: 407 [2018-10-10 15:20:01,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:20:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-10 15:20:01,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 379. [2018-10-10 15:20:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-10 15:20:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 382 transitions. [2018-10-10 15:20:01,277 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 382 transitions. Word has length 352 [2018-10-10 15:20:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:01,278 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 382 transitions. [2018-10-10 15:20:01,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:20:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 382 transitions. [2018-10-10 15:20:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-10 15:20:01,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:01,280 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-10 15:20:01,281 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:01,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash 817265542, now seen corresponding path program 13 times [2018-10-10 15:20:01,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 1032 proven. 421 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2018-10-10 15:20:01,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:01,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:20:01,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:20:01,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:20:01,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:20:01,954 INFO L87 Difference]: Start difference. First operand 379 states and 382 transitions. Second operand 16 states. [2018-10-10 15:20:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:02,608 INFO L93 Difference]: Finished difference Result 394 states and 397 transitions. [2018-10-10 15:20:02,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:20:02,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 367 [2018-10-10 15:20:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:02,614 INFO L225 Difference]: With dead ends: 394 [2018-10-10 15:20:02,614 INFO L226 Difference]: Without dead ends: 394 [2018-10-10 15:20:02,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:20:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-10 15:20:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-10-10 15:20:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-10 15:20:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 397 transitions. [2018-10-10 15:20:02,621 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 397 transitions. Word has length 367 [2018-10-10 15:20:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:02,622 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 397 transitions. [2018-10-10 15:20:02,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:20:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 397 transitions. [2018-10-10 15:20:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-10 15:20:02,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:02,624 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-10 15:20:02,625 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:02,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash -912424352, now seen corresponding path program 14 times [2018-10-10 15:20:02,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2134 backedges. 965 proven. 950 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-10-10 15:20:04,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:04,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:20:04,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:20:04,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:20:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:20:04,697 INFO L87 Difference]: Start difference. First operand 394 states and 397 transitions. Second operand 20 states. [2018-10-10 15:20:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:05,827 INFO L93 Difference]: Finished difference Result 426 states and 429 transitions. [2018-10-10 15:20:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:20:05,828 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 382 [2018-10-10 15:20:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:05,831 INFO L225 Difference]: With dead ends: 426 [2018-10-10 15:20:05,831 INFO L226 Difference]: Without dead ends: 426 [2018-10-10 15:20:05,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:20:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-10 15:20:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2018-10-10 15:20:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-10 15:20:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 428 transitions. [2018-10-10 15:20:05,840 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 428 transitions. Word has length 382 [2018-10-10 15:20:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:05,840 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 428 transitions. [2018-10-10 15:20:05,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:20:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 428 transitions. [2018-10-10 15:20:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-10 15:20:05,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:05,844 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-10 15:20:05,844 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:05,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1578042338, now seen corresponding path program 15 times [2018-10-10 15:20:05,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2383 backedges. 29 proven. 2021 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-10-10 15:20:07,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:07,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:20:07,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:20:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:20:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:20:07,133 INFO L87 Difference]: Start difference. First operand 424 states and 428 transitions. Second operand 23 states. [2018-10-10 15:20:07,735 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 15:20:09,039 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-10 15:20:11,880 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-10 15:20:13,793 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-10 15:20:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:14,812 INFO L93 Difference]: Finished difference Result 551 states and 556 transitions. [2018-10-10 15:20:14,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:20:14,813 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 397 [2018-10-10 15:20:14,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:14,817 INFO L225 Difference]: With dead ends: 551 [2018-10-10 15:20:14,817 INFO L226 Difference]: Without dead ends: 551 [2018-10-10 15:20:14,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3683 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2620, Invalid=8300, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 15:20:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-10-10 15:20:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 524. [2018-10-10 15:20:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-10 15:20:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 529 transitions. [2018-10-10 15:20:14,829 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 529 transitions. Word has length 397 [2018-10-10 15:20:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:14,829 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 529 transitions. [2018-10-10 15:20:14,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:20:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 529 transitions. [2018-10-10 15:20:14,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-10 15:20:14,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:14,833 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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-10 15:20:14,833 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:14,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1956671472, now seen corresponding path program 16 times [2018-10-10 15:20:14,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3985 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 2920 trivial. 0 not checked. [2018-10-10 15:20:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:20:16,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:20:16,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:20:16,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:20:16,814 INFO L87 Difference]: Start difference. First operand 524 states and 529 transitions. Second operand 16 states. [2018-10-10 15:20:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:18,145 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2018-10-10 15:20:18,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:20:18,145 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 497 [2018-10-10 15:20:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:18,149 INFO L225 Difference]: With dead ends: 574 [2018-10-10 15:20:18,149 INFO L226 Difference]: Without dead ends: 574 [2018-10-10 15:20:18,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:20:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-10 15:20:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 524. [2018-10-10 15:20:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-10 15:20:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 528 transitions. [2018-10-10 15:20:18,158 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 528 transitions. Word has length 497 [2018-10-10 15:20:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:18,159 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 528 transitions. [2018-10-10 15:20:18,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:20:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 528 transitions. [2018-10-10 15:20:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-10 15:20:18,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:18,163 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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-10 15:20:18,163 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:18,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1958584086, now seen corresponding path program 17 times [2018-10-10 15:20:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4325 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2018-10-10 15:20:19,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:19,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:20:19,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:20:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:20:19,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:20:19,799 INFO L87 Difference]: Start difference. First operand 524 states and 528 transitions. Second operand 23 states. [2018-10-10 15:20:22,702 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-10 15:20:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:23,540 INFO L93 Difference]: Finished difference Result 651 states and 656 transitions. [2018-10-10 15:20:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:20:23,541 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 512 [2018-10-10 15:20:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:23,544 INFO L225 Difference]: With dead ends: 651 [2018-10-10 15:20:23,544 INFO L226 Difference]: Without dead ends: 651 [2018-10-10 15:20:23,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1572, Invalid=4280, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:20:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-10-10 15:20:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 624. [2018-10-10 15:20:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-10 15:20:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 629 transitions. [2018-10-10 15:20:23,555 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 629 transitions. Word has length 512 [2018-10-10 15:20:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:23,555 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 629 transitions. [2018-10-10 15:20:23,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:20:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 629 transitions. [2018-10-10 15:20:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-10 15:20:23,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:23,560 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:23,560 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:23,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash 942915624, now seen corresponding path program 18 times [2018-10-10 15:20:23,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6413 backedges. 0 proven. 5695 refuted. 0 times theorem prover too weak. 718 trivial. 0 not checked. [2018-10-10 15:20:25,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:25,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:20:25,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:20:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:20:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:20:25,142 INFO L87 Difference]: Start difference. First operand 624 states and 629 transitions. Second operand 25 states. [2018-10-10 15:20:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:29,275 INFO L93 Difference]: Finished difference Result 751 states and 757 transitions. [2018-10-10 15:20:29,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:20:29,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 612 [2018-10-10 15:20:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:29,280 INFO L225 Difference]: With dead ends: 751 [2018-10-10 15:20:29,280 INFO L226 Difference]: Without dead ends: 751 [2018-10-10 15:20:29,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1973, Invalid=5509, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:20:29,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-10-10 15:20:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 724. [2018-10-10 15:20:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-10 15:20:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 730 transitions. [2018-10-10 15:20:29,292 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 730 transitions. Word has length 612 [2018-10-10 15:20:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:29,292 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 730 transitions. [2018-10-10 15:20:29,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:20:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 730 transitions. [2018-10-10 15:20:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-10-10 15:20:29,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:29,298 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:29,298 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:29,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 3190842, now seen corresponding path program 19 times [2018-10-10 15:20:29,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8038 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2018-10-10 15:20:30,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:30,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:20:30,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:20:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:20:30,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:20:30,933 INFO L87 Difference]: Start difference. First operand 724 states and 730 transitions. Second operand 27 states. [2018-10-10 15:20:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:35,947 INFO L93 Difference]: Finished difference Result 851 states and 858 transitions. [2018-10-10 15:20:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:20:35,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 712 [2018-10-10 15:20:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:35,953 INFO L225 Difference]: With dead ends: 851 [2018-10-10 15:20:35,953 INFO L226 Difference]: Without dead ends: 851 [2018-10-10 15:20:35,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2418, Invalid=6894, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:20:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-10 15:20:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 824. [2018-10-10 15:20:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-10-10 15:20:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 831 transitions. [2018-10-10 15:20:35,965 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 831 transitions. Word has length 712 [2018-10-10 15:20:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:35,966 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 831 transitions. [2018-10-10 15:20:35,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:20:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 831 transitions. [2018-10-10 15:20:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2018-10-10 15:20:35,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:35,973 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:35,973 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:35,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1942024012, now seen corresponding path program 20 times [2018-10-10 15:20:35,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11819 backedges. 6915 proven. 1723 refuted. 0 times theorem prover too weak. 3181 trivial. 0 not checked. [2018-10-10 15:20:37,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:37,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:20:37,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:20:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:20:37,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:20:37,244 INFO L87 Difference]: Start difference. First operand 824 states and 831 transitions. Second operand 24 states. [2018-10-10 15:20:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:38,669 INFO L93 Difference]: Finished difference Result 901 states and 908 transitions. [2018-10-10 15:20:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:20:38,670 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 812 [2018-10-10 15:20:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:38,674 INFO L225 Difference]: With dead ends: 901 [2018-10-10 15:20:38,675 INFO L226 Difference]: Without dead ends: 901 [2018-10-10 15:20:38,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:20:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-10-10 15:20:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 899. [2018-10-10 15:20:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-10 15:20:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 907 transitions. [2018-10-10 15:20:38,686 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 907 transitions. Word has length 812 [2018-10-10 15:20:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:38,686 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 907 transitions. [2018-10-10 15:20:38,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:20:38,686 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 907 transitions. [2018-10-10 15:20:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2018-10-10 15:20:38,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:38,694 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:38,695 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:38,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash 298733828, now seen corresponding path program 21 times [2018-10-10 15:20:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 43 proven. 12909 refuted. 0 times theorem prover too weak. 1289 trivial. 0 not checked. [2018-10-10 15:20:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:41,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:20:41,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:20:41,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:20:41,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:20:41,299 INFO L87 Difference]: Start difference. First operand 899 states and 907 transitions. Second operand 31 states. [2018-10-10 15:20:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:52,283 INFO L93 Difference]: Finished difference Result 1041 states and 1050 transitions. [2018-10-10 15:20:52,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-10 15:20:52,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 872 [2018-10-10 15:20:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:52,289 INFO L225 Difference]: With dead ends: 1041 [2018-10-10 15:20:52,289 INFO L226 Difference]: Without dead ends: 1041 [2018-10-10 15:20:52,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12209 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=6628, Invalid=24524, Unknown=0, NotChecked=0, Total=31152 [2018-10-10 15:20:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-10-10 15:20:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1014. [2018-10-10 15:20:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-10 15:20:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1023 transitions. [2018-10-10 15:20:52,305 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1023 transitions. Word has length 872 [2018-10-10 15:20:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:52,305 INFO L481 AbstractCegarLoop]: Abstraction has 1014 states and 1023 transitions. [2018-10-10 15:20:52,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:20:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1023 transitions. [2018-10-10 15:20:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-10-10 15:20:52,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:52,315 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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-10 15:20:52,315 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:52,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash -572144972, now seen corresponding path program 22 times [2018-10-10 15:20:52,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18582 backedges. 11461 proven. 2785 refuted. 0 times theorem prover too weak. 4336 trivial. 0 not checked. [2018-10-10 15:20:54,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:54,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:20:54,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:20:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:20:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:20:54,771 INFO L87 Difference]: Start difference. First operand 1014 states and 1023 transitions. Second operand 28 states. [2018-10-10 15:20:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:56,493 INFO L93 Difference]: Finished difference Result 1093 states and 1101 transitions. [2018-10-10 15:20:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:20:56,494 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 987 [2018-10-10 15:20:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:56,498 INFO L225 Difference]: With dead ends: 1093 [2018-10-10 15:20:56,498 INFO L226 Difference]: Without dead ends: 1093 [2018-10-10 15:20:56,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=814, Invalid=3346, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:20:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-10 15:20:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1089. [2018-10-10 15:20:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-10-10 15:20:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1099 transitions. [2018-10-10 15:20:56,509 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1099 transitions. Word has length 987 [2018-10-10 15:20:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:56,510 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1099 transitions. [2018-10-10 15:20:56,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:20:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1099 transitions. [2018-10-10 15:20:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-10-10 15:20:56,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:56,521 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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-10 15:20:56,521 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:56,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash -875195140, now seen corresponding path program 23 times [2018-10-10 15:20:56,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21608 backedges. 13806 proven. 6181 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [2018-10-10 15:20:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:20:58,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:20:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:20:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:20:58,826 INFO L87 Difference]: Start difference. First operand 1089 states and 1099 transitions. Second operand 36 states. [2018-10-10 15:21:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:01,265 INFO L93 Difference]: Finished difference Result 1153 states and 1161 transitions. [2018-10-10 15:21:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:21:01,266 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1047 [2018-10-10 15:21:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:01,270 INFO L225 Difference]: With dead ends: 1153 [2018-10-10 15:21:01,270 INFO L226 Difference]: Without dead ends: 1153 [2018-10-10 15:21:01,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1119, Invalid=4733, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:21:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-10 15:21:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1119. [2018-10-10 15:21:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-10 15:21:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1130 transitions. [2018-10-10 15:21:01,282 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1130 transitions. Word has length 1047 [2018-10-10 15:21:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:01,283 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 1130 transitions. [2018-10-10 15:21:01,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:21:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1130 transitions. [2018-10-10 15:21:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-10-10 15:21:01,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:01,294 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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-10 15:21:01,294 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:01,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1922725874, now seen corresponding path program 24 times [2018-10-10 15:21:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22402 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 18999 trivial. 0 not checked. [2018-10-10 15:21:03,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:03,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:21:03,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:21:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:21:03,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:21:03,884 INFO L87 Difference]: Start difference. First operand 1119 states and 1130 transitions. Second operand 19 states. [2018-10-10 15:21:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:05,717 INFO L93 Difference]: Finished difference Result 1243 states and 1256 transitions. [2018-10-10 15:21:05,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:21:05,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1062 [2018-10-10 15:21:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:05,724 INFO L225 Difference]: With dead ends: 1243 [2018-10-10 15:21:05,724 INFO L226 Difference]: Without dead ends: 1243 [2018-10-10 15:21:05,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=396, Invalid=1164, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:21:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-10-10 15:21:05,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1119. [2018-10-10 15:21:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-10 15:21:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1129 transitions. [2018-10-10 15:21:05,745 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1129 transitions. Word has length 1062 [2018-10-10 15:21:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:05,746 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 1129 transitions. [2018-10-10 15:21:05,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:21:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1129 transitions. [2018-10-10 15:21:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2018-10-10 15:21:05,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:05,758 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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-10 15:21:05,758 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:05,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 333769560, now seen corresponding path program 25 times [2018-10-10 15:21:05,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 23211 backedges. 0 proven. 21117 refuted. 0 times theorem prover too weak. 2094 trivial. 0 not checked. [2018-10-10 15:21:09,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:09,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:21:09,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:21:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:21:09,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:21:09,034 INFO L87 Difference]: Start difference. First operand 1119 states and 1129 transitions. Second operand 31 states. [2018-10-10 15:21:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:15,536 INFO L93 Difference]: Finished difference Result 1291 states and 1302 transitions. [2018-10-10 15:21:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:21:15,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1077 [2018-10-10 15:21:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:15,541 INFO L225 Difference]: With dead ends: 1291 [2018-10-10 15:21:15,541 INFO L226 Difference]: Without dead ends: 1291 [2018-10-10 15:21:15,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4389 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3440, Invalid=10132, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 15:21:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-10 15:21:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1264. [2018-10-10 15:21:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2018-10-10 15:21:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1275 transitions. [2018-10-10 15:21:15,552 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1275 transitions. Word has length 1077 [2018-10-10 15:21:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:15,553 INFO L481 AbstractCegarLoop]: Abstraction has 1264 states and 1275 transitions. [2018-10-10 15:21:15,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:21:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1275 transitions. [2018-10-10 15:21:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-10-10 15:21:15,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:15,567 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 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-10 15:21:15,567 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:15,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1784176444, now seen corresponding path program 26 times [2018-10-10 15:21:15,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30520 backedges. 0 proven. 28059 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2018-10-10 15:21:19,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:19,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:21:19,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:21:19,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:21:19,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:21:19,672 INFO L87 Difference]: Start difference. First operand 1264 states and 1275 transitions. Second operand 35 states. [2018-10-10 15:21:23,536 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-10 15:21:32,985 WARN L178 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-10 15:21:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:36,851 INFO L93 Difference]: Finished difference Result 1436 states and 1448 transitions. [2018-10-10 15:21:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-10 15:21:36,858 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1222 [2018-10-10 15:21:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:36,864 INFO L225 Difference]: With dead ends: 1436 [2018-10-10 15:21:36,864 INFO L226 Difference]: Without dead ends: 1436 [2018-10-10 15:21:36,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20146 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=9090, Invalid=40862, Unknown=0, NotChecked=0, Total=49952 [2018-10-10 15:21:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-10-10 15:21:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1409. [2018-10-10 15:21:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2018-10-10 15:21:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1421 transitions. [2018-10-10 15:21:36,882 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1421 transitions. Word has length 1222 [2018-10-10 15:21:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:36,883 INFO L481 AbstractCegarLoop]: Abstraction has 1409 states and 1421 transitions. [2018-10-10 15:21:36,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:21:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1421 transitions. [2018-10-10 15:21:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1368 [2018-10-10 15:21:36,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:36,899 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 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-10 15:21:36,899 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:36,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1776226344, now seen corresponding path program 27 times [2018-10-10 15:21:36,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 38830 backedges. 25988 proven. 5181 refuted. 0 times theorem prover too weak. 7661 trivial. 0 not checked. [2018-10-10 15:21:39,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:21:39,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:21:39,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:21:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:21:39,375 INFO L87 Difference]: Start difference. First operand 1409 states and 1421 transitions. Second operand 34 states. [2018-10-10 15:21:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:41,509 INFO L93 Difference]: Finished difference Result 1495 states and 1505 transitions. [2018-10-10 15:21:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:21:41,510 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1367 [2018-10-10 15:21:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:41,515 INFO L225 Difference]: With dead ends: 1495 [2018-10-10 15:21:41,515 INFO L226 Difference]: Without dead ends: 1495 [2018-10-10 15:21:41,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1016, Invalid=4240, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:21:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-10-10 15:21:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1424. [2018-10-10 15:21:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2018-10-10 15:21:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1436 transitions. [2018-10-10 15:21:41,528 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1436 transitions. Word has length 1367 [2018-10-10 15:21:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:41,528 INFO L481 AbstractCegarLoop]: Abstraction has 1424 states and 1436 transitions. [2018-10-10 15:21:41,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:21:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1436 transitions. [2018-10-10 15:21:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1383 [2018-10-10 15:21:41,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:41,546 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 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-10 15:21:41,546 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:41,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1972908722, now seen corresponding path program 28 times [2018-10-10 15:21:41,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 39896 backedges. 57 proven. 36840 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2018-10-10 15:21:46,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:46,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:21:46,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:21:46,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:21:46,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:21:46,720 INFO L87 Difference]: Start difference. First operand 1424 states and 1436 transitions. Second operand 37 states. [2018-10-10 15:22:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:03,531 INFO L93 Difference]: Finished difference Result 1596 states and 1609 transitions. [2018-10-10 15:22:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 15:22:03,532 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1382 [2018-10-10 15:22:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:03,538 INFO L225 Difference]: With dead ends: 1596 [2018-10-10 15:22:03,538 INFO L226 Difference]: Without dead ends: 1596 [2018-10-10 15:22:03,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21848 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=10768, Invalid=42362, Unknown=0, NotChecked=0, Total=53130 [2018-10-10 15:22:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-10 15:22:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1569. [2018-10-10 15:22:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2018-10-10 15:22:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1582 transitions. [2018-10-10 15:22:03,553 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1582 transitions. Word has length 1382 [2018-10-10 15:22:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:03,553 INFO L481 AbstractCegarLoop]: Abstraction has 1569 states and 1582 transitions. [2018-10-10 15:22:03,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:22:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1582 transitions. [2018-10-10 15:22:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1528 [2018-10-10 15:22:03,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:03,572 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 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-10 15:22:03,572 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:03,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash 673990662, now seen corresponding path program 29 times [2018-10-10 15:22:03,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 49328 backedges. 57 proven. 45844 refuted. 0 times theorem prover too weak. 3427 trivial. 0 not checked. [2018-10-10 15:22:09,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:09,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:22:09,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:22:09,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:22:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:22:09,547 INFO L87 Difference]: Start difference. First operand 1569 states and 1582 transitions. Second operand 39 states. [2018-10-10 15:22:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:27,523 INFO L93 Difference]: Finished difference Result 1741 states and 1755 transitions. [2018-10-10 15:22:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-10 15:22:27,523 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1527 [2018-10-10 15:22:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:27,529 INFO L225 Difference]: With dead ends: 1741 [2018-10-10 15:22:27,529 INFO L226 Difference]: Without dead ends: 1741 [2018-10-10 15:22:27,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25679 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=12364, Invalid=49388, Unknown=0, NotChecked=0, Total=61752 [2018-10-10 15:22:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2018-10-10 15:22:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1714. [2018-10-10 15:22:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-10-10 15:22:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 1728 transitions. [2018-10-10 15:22:27,546 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 1728 transitions. Word has length 1527 [2018-10-10 15:22:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:27,547 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 1728 transitions. [2018-10-10 15:22:27,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:22:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1728 transitions. [2018-10-10 15:22:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-10 15:22:27,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:27,567 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 87, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 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-10 15:22:27,567 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:27,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1182340174, now seen corresponding path program 30 times [2018-10-10 15:22:27,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 59761 backedges. 57 proven. 55849 refuted. 0 times theorem prover too weak. 3855 trivial. 0 not checked. [2018-10-10 15:22:34,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:34,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:22:34,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:22:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:22:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:22:34,606 INFO L87 Difference]: Start difference. First operand 1714 states and 1728 transitions. Second operand 41 states. [2018-10-10 15:22:51,184 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-10 15:22:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:54,680 INFO L93 Difference]: Finished difference Result 1886 states and 1901 transitions. [2018-10-10 15:22:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-10-10 15:22:54,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1672 [2018-10-10 15:22:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:54,687 INFO L225 Difference]: With dead ends: 1886 [2018-10-10 15:22:54,687 INFO L226 Difference]: Without dead ends: 1886 [2018-10-10 15:22:54,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29819 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=14068, Invalid=56954, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 15:22:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-10-10 15:22:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1859. [2018-10-10 15:22:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1859 states. [2018-10-10 15:22:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 1874 transitions. [2018-10-10 15:22:54,704 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 1874 transitions. Word has length 1672 [2018-10-10 15:22:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:54,705 INFO L481 AbstractCegarLoop]: Abstraction has 1859 states and 1874 transitions. [2018-10-10 15:22:54,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:22:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 1874 transitions. [2018-10-10 15:22:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2018-10-10 15:22:54,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:54,726 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 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-10 15:22:54,726 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:54,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 862052614, now seen corresponding path program 31 times [2018-10-10 15:22:54,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 71195 backedges. 54086 proven. 10836 refuted. 0 times theorem prover too weak. 6273 trivial. 0 not checked. [2018-10-10 15:22:58,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:58,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:22:58,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:22:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:22:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:22:58,269 INFO L87 Difference]: Start difference. First operand 1859 states and 1874 transitions. Second operand 44 states. [2018-10-10 15:23:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:01,744 INFO L93 Difference]: Finished difference Result 1979 states and 1992 transitions. [2018-10-10 15:23:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:23:01,745 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1817 [2018-10-10 15:23:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:01,751 INFO L225 Difference]: With dead ends: 1979 [2018-10-10 15:23:01,751 INFO L226 Difference]: Without dead ends: 1979 [2018-10-10 15:23:01,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1654, Invalid=7088, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:23:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-10-10 15:23:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1919. [2018-10-10 15:23:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2018-10-10 15:23:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 1935 transitions. [2018-10-10 15:23:01,766 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 1935 transitions. Word has length 1817 [2018-10-10 15:23:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:01,767 INFO L481 AbstractCegarLoop]: Abstraction has 1919 states and 1935 transitions. [2018-10-10 15:23:01,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:23:01,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 1935 transitions. [2018-10-10 15:23:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1863 [2018-10-10 15:23:01,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:01,787 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 98, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 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-10 15:23:01,787 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:01,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash 71961304, now seen corresponding path program 32 times [2018-10-10 15:23:01,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 75572 backedges. 55675 proven. 9578 refuted. 0 times theorem prover too weak. 10319 trivial. 0 not checked. [2018-10-10 15:23:04,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:04,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:23:04,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:23:04,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:23:04,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:23:04,904 INFO L87 Difference]: Start difference. First operand 1919 states and 1935 transitions. Second operand 42 states. [2018-10-10 15:23:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:08,135 INFO L93 Difference]: Finished difference Result 2007 states and 2020 transitions. [2018-10-10 15:23:08,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:23:08,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1862 [2018-10-10 15:23:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:08,141 INFO L225 Difference]: With dead ends: 2007 [2018-10-10 15:23:08,141 INFO L226 Difference]: Without dead ends: 2007 [2018-10-10 15:23:08,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1518, Invalid=6492, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:23:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2018-10-10 15:23:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1934. [2018-10-10 15:23:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-10-10 15:23:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 1950 transitions. [2018-10-10 15:23:08,158 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 1950 transitions. Word has length 1862 [2018-10-10 15:23:08,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:08,158 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 1950 transitions. [2018-10-10 15:23:08,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:23:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 1950 transitions. [2018-10-10 15:23:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1878 [2018-10-10 15:23:08,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:08,179 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 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-10 15:23:08,179 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:08,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:08,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1408255042, now seen corresponding path program 33 times [2018-10-10 15:23:08,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 77061 backedges. 104 proven. 72237 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2018-10-10 15:23:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:16,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:23:16,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:23:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:23:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1685, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:23:16,684 INFO L87 Difference]: Start difference. First operand 1934 states and 1950 transitions. Second operand 45 states. [2018-10-10 15:23:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:41,760 INFO L93 Difference]: Finished difference Result 2121 states and 2138 transitions. [2018-10-10 15:23:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-10-10 15:23:41,760 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1877 [2018-10-10 15:23:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:41,768 INFO L225 Difference]: With dead ends: 2121 [2018-10-10 15:23:41,768 INFO L226 Difference]: Without dead ends: 2121 [2018-10-10 15:23:41,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45915 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=18776, Invalid=87174, Unknown=0, NotChecked=0, Total=105950 [2018-10-10 15:23:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2018-10-10 15:23:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2094. [2018-10-10 15:23:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2018-10-10 15:23:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2111 transitions. [2018-10-10 15:23:41,791 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2111 transitions. Word has length 1877 [2018-10-10 15:23:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:41,792 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 2111 transitions. [2018-10-10 15:23:41,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:23:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2111 transitions. [2018-10-10 15:23:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2038 [2018-10-10 15:23:41,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:41,815 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 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-10 15:23:41,815 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1222431468, now seen corresponding path program 34 times [2018-10-10 15:23:41,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 91605 backedges. 0 proven. 86232 refuted. 0 times theorem prover too weak. 5373 trivial. 0 not checked. [2018-10-10 15:23:51,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:51,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:23:51,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:23:51,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:23:51,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:23:51,219 INFO L87 Difference]: Start difference. First operand 2094 states and 2111 transitions. Second operand 43 states. [2018-10-10 15:24:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:03,960 INFO L93 Difference]: Finished difference Result 2281 states and 2299 transitions. [2018-10-10 15:24:03,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-10 15:24:03,960 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2037 [2018-10-10 15:24:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:03,970 INFO L225 Difference]: With dead ends: 2281 [2018-10-10 15:24:03,970 INFO L226 Difference]: Without dead ends: 2281 [2018-10-10 15:24:03,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10875 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=7562, Invalid=23590, Unknown=0, NotChecked=0, Total=31152 [2018-10-10 15:24:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2018-10-10 15:24:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2254. [2018-10-10 15:24:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-10-10 15:24:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2272 transitions. [2018-10-10 15:24:03,993 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2272 transitions. Word has length 2037 [2018-10-10 15:24:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:03,995 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 2272 transitions. [2018-10-10 15:24:03,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:24:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2272 transitions. [2018-10-10 15:24:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2198 [2018-10-10 15:24:04,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:04,027 INFO L375 BasicCegarLoop]: trace histogram [118, 118, 118, 118, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:04,027 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:04,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1873859098, now seen corresponding path program 35 times [2018-10-10 15:24:04,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 107407 backedges. 0 proven. 101485 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2018-10-10 15:24:15,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:15,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:24:15,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:24:15,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:24:15,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1633, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:24:15,154 INFO L87 Difference]: Start difference. First operand 2254 states and 2272 transitions. Second operand 45 states. [2018-10-10 15:24:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:28,975 INFO L93 Difference]: Finished difference Result 2441 states and 2460 transitions. [2018-10-10 15:24:28,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-10 15:24:28,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2197 [2018-10-10 15:24:28,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:28,982 INFO L225 Difference]: With dead ends: 2441 [2018-10-10 15:24:28,982 INFO L226 Difference]: Without dead ends: 2441 [2018-10-10 15:24:28,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12236 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=8403, Invalid=26379, Unknown=0, NotChecked=0, Total=34782 [2018-10-10 15:24:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-10-10 15:24:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2414. [2018-10-10 15:24:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2018-10-10 15:24:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2433 transitions. [2018-10-10 15:24:29,002 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2433 transitions. Word has length 2197 [2018-10-10 15:24:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:29,003 INFO L481 AbstractCegarLoop]: Abstraction has 2414 states and 2433 transitions. [2018-10-10 15:24:29,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:24:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2433 transitions. [2018-10-10 15:24:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2358 [2018-10-10 15:24:29,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:29,032 INFO L375 BasicCegarLoop]: trace histogram [127, 127, 127, 127, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:29,033 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:29,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1268008632, now seen corresponding path program 36 times [2018-10-10 15:24:29,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 124467 backedges. 57 proven. 117996 refuted. 0 times theorem prover too weak. 6414 trivial. 0 not checked. [2018-10-10 15:24:41,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:41,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:24:41,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:24:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:24:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1961, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:24:41,399 INFO L87 Difference]: Start difference. First operand 2414 states and 2433 transitions. Second operand 49 states. [2018-10-10 15:25:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:10,389 INFO L93 Difference]: Finished difference Result 2601 states and 2621 transitions. [2018-10-10 15:25:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 294 states. [2018-10-10 15:25:10,389 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2357 [2018-10-10 15:25:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:10,394 INFO L225 Difference]: With dead ends: 2601 [2018-10-10 15:25:10,394 INFO L226 Difference]: Without dead ends: 2601 [2018-10-10 15:25:10,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49469 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=21964, Invalid=92618, Unknown=0, NotChecked=0, Total=114582 [2018-10-10 15:25:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2018-10-10 15:25:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2574. [2018-10-10 15:25:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2018-10-10 15:25:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 2594 transitions. [2018-10-10 15:25:10,420 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 2594 transitions. Word has length 2357 [2018-10-10 15:25:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:10,422 INFO L481 AbstractCegarLoop]: Abstraction has 2574 states and 2594 transitions. [2018-10-10 15:25:10,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:25:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 2594 transitions. [2018-10-10 15:25:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2518 [2018-10-10 15:25:10,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:10,461 INFO L375 BasicCegarLoop]: trace histogram [136, 136, 136, 136, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 135, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 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-10 15:25:10,461 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:10,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash 720210038, now seen corresponding path program 37 times [2018-10-10 15:25:10,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 142785 backedges. 0 proven. 135765 refuted. 0 times theorem prover too weak. 7020 trivial. 0 not checked. [2018-10-10 15:25:24,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:24,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:25:24,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:25:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:25:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1929, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:25:24,392 INFO L87 Difference]: Start difference. First operand 2574 states and 2594 transitions. Second operand 49 states. [2018-10-10 15:25:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:39,954 INFO L93 Difference]: Finished difference Result 2761 states and 2782 transitions. [2018-10-10 15:25:39,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-10 15:25:39,954 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2517 [2018-10-10 15:25:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:39,958 INFO L225 Difference]: With dead ends: 2761 [2018-10-10 15:25:39,958 INFO L226 Difference]: Without dead ends: 2761 [2018-10-10 15:25:39,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15198 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=10217, Invalid=32425, Unknown=0, NotChecked=0, Total=42642 [2018-10-10 15:25:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2018-10-10 15:25:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2734. [2018-10-10 15:25:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-10-10 15:25:39,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 2755 transitions. [2018-10-10 15:25:39,976 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 2755 transitions. Word has length 2517 [2018-10-10 15:25:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:39,977 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 2755 transitions. [2018-10-10 15:25:39,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:25:39,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 2755 transitions. [2018-10-10 15:25:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2678 [2018-10-10 15:25:40,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:40,017 INFO L375 BasicCegarLoop]: trace histogram [145, 145, 145, 145, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 144, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 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-10 15:25:40,018 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:40,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1729511332, now seen corresponding path program 38 times [2018-10-10 15:25:40,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 162361 backedges. 0 proven. 154792 refuted. 0 times theorem prover too weak. 7569 trivial. 0 not checked. [2018-10-10 15:25:55,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:55,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:25:55,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:25:55,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:25:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2086, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:25:55,352 INFO L87 Difference]: Start difference. First operand 2734 states and 2755 transitions. Second operand 51 states. [2018-10-10 15:26:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:12,939 INFO L93 Difference]: Finished difference Result 2921 states and 2943 transitions. [2018-10-10 15:26:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-10 15:26:12,940 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2677 [2018-10-10 15:26:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:12,946 INFO L225 Difference]: With dead ends: 2921 [2018-10-10 15:26:12,946 INFO L226 Difference]: Without dead ends: 2921 [2018-10-10 15:26:12,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16799 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=11190, Invalid=35682, Unknown=0, NotChecked=0, Total=46872 [2018-10-10 15:26:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-10-10 15:26:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2894. [2018-10-10 15:26:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2018-10-10 15:26:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 2916 transitions. [2018-10-10 15:26:12,972 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 2916 transitions. Word has length 2677 [2018-10-10 15:26:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:12,974 INFO L481 AbstractCegarLoop]: Abstraction has 2894 states and 2916 transitions. [2018-10-10 15:26:12,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:26:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 2916 transitions. [2018-10-10 15:26:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2838 [2018-10-10 15:26:13,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:13,029 INFO L375 BasicCegarLoop]: trace histogram [154, 154, 154, 154, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 153, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:13,029 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:13,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2093342418, now seen corresponding path program 39 times [2018-10-10 15:26:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 183195 backedges. 146749 proven. 18309 refuted. 0 times theorem prover too weak. 18137 trivial. 0 not checked. [2018-10-10 15:26:19,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:19,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:26:19,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:26:19,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:26:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2478, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:26:19,144 INFO L87 Difference]: Start difference. First operand 2894 states and 2916 transitions. Second operand 54 states. [2018-10-10 15:26:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:23,962 INFO L93 Difference]: Finished difference Result 3072 states and 3091 transitions. [2018-10-10 15:26:23,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:26:23,962 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2837 [2018-10-10 15:26:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:23,968 INFO L225 Difference]: With dead ends: 3072 [2018-10-10 15:26:23,968 INFO L226 Difference]: Without dead ends: 3072 [2018-10-10 15:26:23,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2490, Invalid=10620, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:26:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-10 15:26:23,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2984. [2018-10-10 15:26:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2018-10-10 15:26:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3007 transitions. [2018-10-10 15:26:23,993 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3007 transitions. Word has length 2837 [2018-10-10 15:26:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:23,994 INFO L481 AbstractCegarLoop]: Abstraction has 2984 states and 3007 transitions. [2018-10-10 15:26:23,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:26:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3007 transitions. [2018-10-10 15:26:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2913 [2018-10-10 15:26:24,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:24,064 INFO L375 BasicCegarLoop]: trace histogram [159, 159, 159, 159, 158, 158, 158, 158, 158, 158, 158, 158, 158, 158, 158, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:24,064 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:24,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:24,065 INFO L82 PathProgramCache]: Analyzing trace with hash 457162472, now seen corresponding path program 40 times [2018-10-10 15:26:24,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 194945 backedges. 107455 proven. 8320 refuted. 0 times theorem prover too weak. 79170 trivial. 0 not checked. [2018-10-10 15:26:29,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:29,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:26:29,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:26:29,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:26:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:26:29,988 INFO L87 Difference]: Start difference. First operand 2984 states and 3007 transitions. Second operand 40 states. [2018-10-10 15:26:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:32,141 INFO L93 Difference]: Finished difference Result 3085 states and 3104 transitions. [2018-10-10 15:26:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:26:32,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2912 [2018-10-10 15:26:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:32,145 INFO L225 Difference]: With dead ends: 3085 [2018-10-10 15:26:32,146 INFO L226 Difference]: Without dead ends: 3085 [2018-10-10 15:26:32,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1392, Invalid=5918, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:26:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2018-10-10 15:26:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2999. [2018-10-10 15:26:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-10 15:26:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3022 transitions. [2018-10-10 15:26:32,171 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3022 transitions. Word has length 2912 [2018-10-10 15:26:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:32,171 INFO L481 AbstractCegarLoop]: Abstraction has 2999 states and 3022 transitions. [2018-10-10 15:26:32,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:26:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3022 transitions. [2018-10-10 15:26:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2928 [2018-10-10 15:26:32,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:32,236 INFO L375 BasicCegarLoop]: trace histogram [160, 160, 160, 160, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 159, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:32,236 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:32,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash -827790670, now seen corresponding path program 41 times [2018-10-10 15:26:32,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:26:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 197340 backedges. 152420 proven. 16930 refuted. 0 times theorem prover too weak. 27990 trivial. 0 not checked. [2018-10-10 15:26:38,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:26:38,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:26:38,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:26:38,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:26:38,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:26:38,782 INFO L87 Difference]: Start difference. First operand 2999 states and 3022 transitions. Second operand 52 states. [2018-10-10 15:26:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:26:43,277 INFO L93 Difference]: Finished difference Result 3115 states and 3134 transitions. [2018-10-10 15:26:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:26:43,277 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2927 [2018-10-10 15:26:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:26:43,282 INFO L225 Difference]: With dead ends: 3115 [2018-10-10 15:26:43,282 INFO L226 Difference]: Without dead ends: 3115 [2018-10-10 15:26:43,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2311, Invalid=9899, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:26:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2018-10-10 15:26:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3014. [2018-10-10 15:26:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2018-10-10 15:26:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 3037 transitions. [2018-10-10 15:26:43,305 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 3037 transitions. Word has length 2927 [2018-10-10 15:26:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:26:43,307 INFO L481 AbstractCegarLoop]: Abstraction has 3014 states and 3037 transitions. [2018-10-10 15:26:43,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:26:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3037 transitions. [2018-10-10 15:26:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2943 [2018-10-10 15:26:43,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:26:43,367 INFO L375 BasicCegarLoop]: trace histogram [161, 161, 161, 161, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 160, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:26:43,367 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:26:43,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:26:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash -856020556, now seen corresponding path program 42 times [2018-10-10 15:26:43,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:26:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 199750 backedges. 57 proven. 190695 refuted. 0 times theorem prover too weak. 8998 trivial. 0 not checked. [2018-10-10 15:27:01,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:01,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:27:01,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:27:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:27:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:27:01,800 INFO L87 Difference]: Start difference. First operand 3014 states and 3037 transitions. Second operand 55 states. [2018-10-10 15:27:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:39,077 INFO L93 Difference]: Finished difference Result 3216 states and 3240 transitions. [2018-10-10 15:27:39,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2018-10-10 15:27:39,077 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 2942 [2018-10-10 15:27:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:39,082 INFO L225 Difference]: With dead ends: 3216 [2018-10-10 15:27:39,082 INFO L226 Difference]: Without dead ends: 3216 [2018-10-10 15:27:39,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67451 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=29020, Invalid=125036, Unknown=0, NotChecked=0, Total=154056 [2018-10-10 15:27:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2018-10-10 15:27:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3189. [2018-10-10 15:27:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2018-10-10 15:27:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 3213 transitions. [2018-10-10 15:27:39,104 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 3213 transitions. Word has length 2942 [2018-10-10 15:27:39,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:39,105 INFO L481 AbstractCegarLoop]: Abstraction has 3189 states and 3213 transitions. [2018-10-10 15:27:39,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:27:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 3213 transitions. [2018-10-10 15:27:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3118 [2018-10-10 15:27:39,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:39,150 INFO L375 BasicCegarLoop]: trace histogram [171, 171, 171, 171, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 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-10 15:27:39,150 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:39,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1762922528, now seen corresponding path program 43 times [2018-10-10 15:27:39,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 225355 backedges. 153543 proven. 13838 refuted. 0 times theorem prover too weak. 57974 trivial. 0 not checked. [2018-10-10 15:27:45,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:45,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:27:45,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:27:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:27:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:27:45,579 INFO L87 Difference]: Start difference. First operand 3189 states and 3213 transitions. Second operand 48 states. [2018-10-10 15:27:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:49,181 INFO L93 Difference]: Finished difference Result 3359 states and 3379 transitions. [2018-10-10 15:27:49,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:27:49,187 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3117 [2018-10-10 15:27:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:49,190 INFO L225 Difference]: With dead ends: 3359 [2018-10-10 15:27:49,190 INFO L226 Difference]: Without dead ends: 3359 [2018-10-10 15:27:49,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1983, Invalid=8523, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:27:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2018-10-10 15:27:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3219. [2018-10-10 15:27:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2018-10-10 15:27:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 3243 transitions. [2018-10-10 15:27:49,210 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 3243 transitions. Word has length 3117 [2018-10-10 15:27:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:49,210 INFO L481 AbstractCegarLoop]: Abstraction has 3219 states and 3243 transitions. [2018-10-10 15:27:49,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:27:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 3243 transitions. [2018-10-10 15:27:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3148 [2018-10-10 15:27:49,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:49,260 INFO L375 BasicCegarLoop]: trace histogram [173, 173, 173, 173, 172, 172, 172, 172, 172, 172, 172, 172, 172, 172, 172, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 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-10 15:27:49,260 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:49,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -350180484, now seen corresponding path program 44 times [2018-10-10 15:27:49,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:27:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 230522 backedges. 93139 proven. 5804 refuted. 0 times theorem prover too weak. 131579 trivial. 0 not checked. [2018-10-10 15:27:55,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:27:55,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:27:55,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:27:55,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:27:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:27:55,131 INFO L87 Difference]: Start difference. First operand 3219 states and 3243 transitions. Second operand 36 states. [2018-10-10 15:27:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:27:58,212 INFO L93 Difference]: Finished difference Result 3255 states and 3276 transitions. [2018-10-10 15:27:58,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:27:58,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 3147 [2018-10-10 15:27:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:27:58,215 INFO L225 Difference]: With dead ends: 3255 [2018-10-10 15:27:58,215 INFO L226 Difference]: Without dead ends: 3255 [2018-10-10 15:27:58,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=5762, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:27:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2018-10-10 15:27:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3249. [2018-10-10 15:27:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2018-10-10 15:27:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 3273 transitions. [2018-10-10 15:27:58,233 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 3273 transitions. Word has length 3147 [2018-10-10 15:27:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:27:58,233 INFO L481 AbstractCegarLoop]: Abstraction has 3249 states and 3273 transitions. [2018-10-10 15:27:58,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:27:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 3273 transitions. [2018-10-10 15:27:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3178 [2018-10-10 15:27:58,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:27:58,283 INFO L375 BasicCegarLoop]: trace histogram [175, 175, 175, 175, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 174, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 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-10 15:27:58,284 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:27:58,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:27:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash -982770528, now seen corresponding path program 45 times [2018-10-10 15:27:58,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:27:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:28:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 235749 backedges. 195743 proven. 30417 refuted. 0 times theorem prover too weak. 9589 trivial. 0 not checked. [2018-10-10 15:28:06,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:28:06,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:28:06,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:28:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:28:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:28:06,731 INFO L87 Difference]: Start difference. First operand 3249 states and 3273 transitions. Second operand 66 states. [2018-10-10 15:28:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:28:13,535 INFO L93 Difference]: Finished difference Result 3317 states and 3337 transitions. [2018-10-10 15:28:13,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:28:13,536 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 3177 [2018-10-10 15:28:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:28:13,540 INFO L225 Difference]: With dead ends: 3317 [2018-10-10 15:28:13,540 INFO L226 Difference]: Without dead ends: 3317 [2018-10-10 15:28:13,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4640 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3756, Invalid=15704, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:28:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2018-10-10 15:28:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3279. [2018-10-10 15:28:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3279 states. [2018-10-10 15:28:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 3304 transitions. [2018-10-10 15:28:13,561 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 3304 transitions. Word has length 3177 [2018-10-10 15:28:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:28:13,562 INFO L481 AbstractCegarLoop]: Abstraction has 3279 states and 3304 transitions. [2018-10-10 15:28:13,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:28:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3304 transitions. [2018-10-10 15:28:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3193 [2018-10-10 15:28:13,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:28:13,614 INFO L375 BasicCegarLoop]: trace histogram [176, 176, 176, 176, 175, 175, 175, 175, 175, 175, 175, 175, 175, 175, 175, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 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-10 15:28:13,614 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:28:13,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:28:13,615 INFO L82 PathProgramCache]: Analyzing trace with hash -339818334, now seen corresponding path program 46 times [2018-10-10 15:28:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:28:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat