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-093a8c0 [2018-10-14 16:27:00,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:27:00,428 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:27:00,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:27:00,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:27:00,441 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:27:00,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:27:00,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:27:00,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:27:00,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:27:00,447 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:27:00,448 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:27:00,448 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:27:00,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:27:00,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:27:00,451 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:27:00,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:27:00,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:27:00,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:27:00,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:27:00,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:27:00,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:27:00,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:27:00,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:27:00,463 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:27:00,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:27:00,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:27:00,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:27:00,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:27:00,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:27:00,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:27:00,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:27:00,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:27:00,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:27:00,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:27:00,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:27:00,471 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-14 16:27:00,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:27:00,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:27:00,482 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:27:00,482 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:27:00,482 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:27:00,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:27:00,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:27:00,483 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:27:00,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:27:00,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:27:00,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:27:00,484 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:27:00,485 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:27:00,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:27:00,486 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:27:00,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:27:00,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:27:00,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:27:00,561 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:27:00,562 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:27:00,563 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-14 16:27:00,563 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-14 16:27:00,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:27:00,653 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:27:00,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:27:00,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:27:00,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:27:00,679 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,681 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,695 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,695 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,702 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,704 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,705 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 14.10 04:27:00" (1/1) ... [2018-10-14 16:27:00,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:27:00,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:27:00,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:27:00,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:27:00,709 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 14.10 04:27:00" (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-14 16:27:00,779 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:27:00,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:27:00,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:27:01,414 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:27:01,415 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:27:01 BoogieIcfgContainer [2018-10-14 16:27:01,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:27:01,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:27:01,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:27:01,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:27:01,421 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 14.10 04:27:00" (1/2) ... [2018-10-14 16:27:01,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118e936a and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:27:01, skipping insertion in model container [2018-10-14 16:27:01,422 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 14.10 04:27:01" (2/2) ... [2018-10-14 16:27:01,424 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_12.bpl [2018-10-14 16:27:01,434 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:27:01,443 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:27:01,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:27:01,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:27:01,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:27:01,490 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:27:01,490 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:27:01,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:27:01,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:27:01,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:27:01,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:27:01,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:27:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-14 16:27:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-14 16:27:01,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:01,521 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-14 16:27:01,522 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:01,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash -2040165820, now seen corresponding path program 1 times [2018-10-14 16:27:01,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:02,318 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-14 16:27:02,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:27:02,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-14 16:27:02,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:27:02,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:27:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:27:02,346 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 10 states. [2018-10-14 16:27:03,177 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-14 16:27:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:03,543 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-14 16:27:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:27:03,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-10-14 16:27:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:03,574 INFO L225 Difference]: With dead ends: 155 [2018-10-14 16:27:03,575 INFO L226 Difference]: Without dead ends: 155 [2018-10-14 16:27:03,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:27:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-14 16:27:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 73. [2018-10-14 16:27:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-14 16:27:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-10-14 16:27:03,640 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 42 [2018-10-14 16:27:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:03,641 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-10-14 16:27:03,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:27:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-10-14 16:27:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-14 16:27:03,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:03,645 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-14 16:27:03,646 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:03,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1285196190, now seen corresponding path program 1 times [2018-10-14 16:27:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:04,067 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-14 16:27:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:04,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:27:04,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:27:04,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:27:04,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:27:04,071 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 12 states. [2018-10-14 16:27:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:05,325 INFO L93 Difference]: Finished difference Result 189 states and 194 transitions. [2018-10-14 16:27:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:27:05,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-10-14 16:27:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:05,331 INFO L225 Difference]: With dead ends: 189 [2018-10-14 16:27:05,332 INFO L226 Difference]: Without dead ends: 189 [2018-10-14 16:27:05,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:27:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-14 16:27:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 88. [2018-10-14 16:27:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-14 16:27:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-10-14 16:27:05,344 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 57 [2018-10-14 16:27:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:05,345 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-10-14 16:27:05,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:27:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-10-14 16:27:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-14 16:27:05,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:05,348 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-14 16:27:05,348 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:05,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash -265811324, now seen corresponding path program 2 times [2018-10-14 16:27:05,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:05,562 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-14 16:27:05,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:05,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:27:05,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:27:05,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:27:05,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:27:05,564 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 10 states. [2018-10-14 16:27:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:05,844 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-10-14 16:27:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 16:27:05,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-10-14 16:27:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:05,853 INFO L225 Difference]: With dead ends: 147 [2018-10-14 16:27:05,853 INFO L226 Difference]: Without dead ends: 147 [2018-10-14 16:27:05,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:27:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-14 16:27:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2018-10-14 16:27:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-14 16:27:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2018-10-14 16:27:05,876 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 72 [2018-10-14 16:27:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:05,879 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2018-10-14 16:27:05,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:27:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-10-14 16:27:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-14 16:27:05,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:05,881 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-14 16:27:05,882 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:05,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1218697110, now seen corresponding path program 1 times [2018-10-14 16:27:05,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:06,155 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-14 16:27:06,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:06,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:27:06,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:27:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:27:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:27:06,158 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand 8 states. [2018-10-14 16:27:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:06,370 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-14 16:27:06,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:27:06,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2018-10-14 16:27:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:06,380 INFO L225 Difference]: With dead ends: 147 [2018-10-14 16:27:06,380 INFO L226 Difference]: Without dead ends: 147 [2018-10-14 16:27:06,386 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-14 16:27:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-14 16:27:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2018-10-14 16:27:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-14 16:27:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2018-10-14 16:27:06,403 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 112 [2018-10-14 16:27:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:06,406 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2018-10-14 16:27:06,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:27:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2018-10-14 16:27:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-14 16:27:06,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:06,409 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-14 16:27:06,409 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:06,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash -356399820, now seen corresponding path program 2 times [2018-10-14 16:27:06,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:07,004 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-14 16:27:07,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:07,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:27:07,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:27:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:27:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:27:07,006 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand 15 states. [2018-10-14 16:27:07,667 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-10-14 16:27:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:08,712 INFO L93 Difference]: Finished difference Result 259 states and 265 transitions. [2018-10-14 16:27:08,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 16:27:08,714 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 127 [2018-10-14 16:27:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:08,717 INFO L225 Difference]: With dead ends: 259 [2018-10-14 16:27:08,717 INFO L226 Difference]: Without dead ends: 259 [2018-10-14 16:27:08,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:27:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-14 16:27:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 143. [2018-10-14 16:27:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-14 16:27:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-10-14 16:27:08,726 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 127 [2018-10-14 16:27:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:08,727 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-10-14 16:27:08,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:27:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-10-14 16:27:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-14 16:27:08,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:08,730 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-14 16:27:08,730 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:08,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash 277740914, now seen corresponding path program 3 times [2018-10-14 16:27:08,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:09,781 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-14 16:27:09,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:09,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:27:09,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:27:09,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:27:09,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:27:09,783 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 14 states. [2018-10-14 16:27:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:10,456 INFO L93 Difference]: Finished difference Result 251 states and 258 transitions. [2018-10-14 16:27:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:27:10,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-10-14 16:27:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:10,464 INFO L225 Difference]: With dead ends: 251 [2018-10-14 16:27:10,464 INFO L226 Difference]: Without dead ends: 251 [2018-10-14 16:27:10,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:27:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-14 16:27:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2018-10-14 16:27:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-14 16:27:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 220 transitions. [2018-10-14 16:27:10,473 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 220 transitions. Word has length 142 [2018-10-14 16:27:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:10,473 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 220 transitions. [2018-10-14 16:27:10,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:27:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 220 transitions. [2018-10-14 16:27:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-14 16:27:10,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:10,476 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-14 16:27:10,477 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:10,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1498155038, now seen corresponding path program 4 times [2018-10-14 16:27:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:10,681 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-14 16:27:10,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:10,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:27:10,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:27:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:27:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:27:10,682 INFO L87 Difference]: Start difference. First operand 213 states and 220 transitions. Second operand 8 states. [2018-10-14 16:27:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:10,814 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2018-10-14 16:27:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:27:10,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2018-10-14 16:27:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:10,816 INFO L225 Difference]: With dead ends: 232 [2018-10-14 16:27:10,816 INFO L226 Difference]: Without dead ends: 232 [2018-10-14 16:27:10,818 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-14 16:27:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-14 16:27:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-14 16:27:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-14 16:27:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 219 transitions. [2018-10-14 16:27:10,826 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 219 transitions. Word has length 167 [2018-10-14 16:27:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:10,827 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 219 transitions. [2018-10-14 16:27:10,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:27:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 219 transitions. [2018-10-14 16:27:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-14 16:27:10,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:10,830 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-14 16:27:10,830 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:10,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:10,831 INFO L82 PathProgramCache]: Analyzing trace with hash 682793504, now seen corresponding path program 5 times [2018-10-14 16:27:10,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:11,054 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-14 16:27:11,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:11,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:27:11,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:27:11,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:27:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:27:11,056 INFO L87 Difference]: Start difference. First operand 213 states and 219 transitions. Second operand 10 states. [2018-10-14 16:27:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:11,369 INFO L93 Difference]: Finished difference Result 232 states and 237 transitions. [2018-10-14 16:27:11,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 16:27:11,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 182 [2018-10-14 16:27:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:11,374 INFO L225 Difference]: With dead ends: 232 [2018-10-14 16:27:11,374 INFO L226 Difference]: Without dead ends: 232 [2018-10-14 16:27:11,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:27:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-14 16:27:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-14 16:27:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-14 16:27:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2018-10-14 16:27:11,380 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 182 [2018-10-14 16:27:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:11,381 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2018-10-14 16:27:11,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:27:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2018-10-14 16:27:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-14 16:27:11,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:11,384 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-14 16:27:11,384 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:11,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1699777502, now seen corresponding path program 6 times [2018-10-14 16:27:11,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:11,661 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-14 16:27:11,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:11,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:27:11,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:27:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:27:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:27:11,662 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand 12 states. [2018-10-14 16:27:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:12,137 INFO L93 Difference]: Finished difference Result 232 states and 236 transitions. [2018-10-14 16:27:12,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 16:27:12,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 197 [2018-10-14 16:27:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:12,140 INFO L225 Difference]: With dead ends: 232 [2018-10-14 16:27:12,142 INFO L226 Difference]: Without dead ends: 232 [2018-10-14 16:27:12,143 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-14 16:27:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-14 16:27:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 213. [2018-10-14 16:27:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-14 16:27:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2018-10-14 16:27:12,149 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 197 [2018-10-14 16:27:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:12,150 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2018-10-14 16:27:12,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:27:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2018-10-14 16:27:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-14 16:27:12,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:12,153 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-14 16:27:12,153 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:12,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1799820768, now seen corresponding path program 7 times [2018-10-14 16:27:12,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:12,645 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-14 16:27:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:27:12,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:27:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:27:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:27:12,647 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 17 states. [2018-10-14 16:27:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:14,629 INFO L93 Difference]: Finished difference Result 333 states and 342 transitions. [2018-10-14 16:27:14,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:27:14,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 212 [2018-10-14 16:27:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:14,633 INFO L225 Difference]: With dead ends: 333 [2018-10-14 16:27:14,633 INFO L226 Difference]: Without dead ends: 333 [2018-10-14 16:27:14,634 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-14 16:27:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-14 16:27:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 252. [2018-10-14 16:27:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-14 16:27:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2018-10-14 16:27:14,640 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 212 [2018-10-14 16:27:14,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:14,640 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2018-10-14 16:27:14,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:27:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2018-10-14 16:27:14,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-14 16:27:14,642 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:14,642 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-14 16:27:14,643 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:14,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -918055116, now seen corresponding path program 8 times [2018-10-14 16:27:14,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:15,078 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-14 16:27:15,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:15,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:27:15,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:27:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:27:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:27:15,080 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 10 states. [2018-10-14 16:27:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:15,238 INFO L93 Difference]: Finished difference Result 273 states and 278 transitions. [2018-10-14 16:27:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:27:15,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2018-10-14 16:27:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:15,240 INFO L225 Difference]: With dead ends: 273 [2018-10-14 16:27:15,240 INFO L226 Difference]: Without dead ends: 266 [2018-10-14 16:27:15,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:27:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-14 16:27:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 253. [2018-10-14 16:27:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-14 16:27:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 257 transitions. [2018-10-14 16:27:15,247 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 257 transitions. Word has length 237 [2018-10-14 16:27:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:15,247 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 257 transitions. [2018-10-14 16:27:15,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:27:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 257 transitions. [2018-10-14 16:27:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-14 16:27:15,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:15,249 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-14 16:27:15,249 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:15,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash 122039438, now seen corresponding path program 9 times [2018-10-14 16:27:15,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:15,932 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-14 16:27:15,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:15,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:27:15,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:27:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:27:15,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:27:15,934 INFO L87 Difference]: Start difference. First operand 253 states and 257 transitions. Second operand 11 states. [2018-10-14 16:27:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:16,220 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2018-10-14 16:27:16,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:27:16,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 252 [2018-10-14 16:27:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:16,223 INFO L225 Difference]: With dead ends: 288 [2018-10-14 16:27:16,223 INFO L226 Difference]: Without dead ends: 281 [2018-10-14 16:27:16,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:27:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-14 16:27:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2018-10-14 16:27:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-14 16:27:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2018-10-14 16:27:16,229 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 252 [2018-10-14 16:27:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:16,229 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2018-10-14 16:27:16,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:27:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2018-10-14 16:27:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-14 16:27:16,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:16,231 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-14 16:27:16,232 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:16,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2131560460, now seen corresponding path program 10 times [2018-10-14 16:27:16,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:16,647 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-14 16:27:16,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:16,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:27:16,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:27:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:27:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:27:16,649 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 14 states. [2018-10-14 16:27:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:17,139 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-10-14 16:27:17,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 16:27:17,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2018-10-14 16:27:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:17,143 INFO L225 Difference]: With dead ends: 305 [2018-10-14 16:27:17,143 INFO L226 Difference]: Without dead ends: 305 [2018-10-14 16:27:17,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:27:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-14 16:27:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-10-14 16:27:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-14 16:27:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2018-10-14 16:27:17,150 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 267 [2018-10-14 16:27:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:17,150 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 285 transitions. [2018-10-14 16:27:17,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:27:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 285 transitions. [2018-10-14 16:27:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-14 16:27:17,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:17,152 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-14 16:27:17,153 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:17,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2066402354, now seen corresponding path program 11 times [2018-10-14 16:27:17,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:17,835 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-14 16:27:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:27:17,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:27:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:27:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:27:17,837 INFO L87 Difference]: Start difference. First operand 283 states and 285 transitions. Second operand 21 states. [2018-10-14 16:27:20,431 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-14 16:27:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:22,360 INFO L93 Difference]: Finished difference Result 384 states and 387 transitions. [2018-10-14 16:27:22,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:27:22,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 282 [2018-10-14 16:27:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:22,364 INFO L225 Difference]: With dead ends: 384 [2018-10-14 16:27:22,364 INFO L226 Difference]: Without dead ends: 384 [2018-10-14 16:27:22,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1888, Invalid=5594, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:27:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-14 16:27:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 353. [2018-10-14 16:27:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-14 16:27:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 356 transitions. [2018-10-14 16:27:22,373 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 356 transitions. Word has length 282 [2018-10-14 16:27:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:22,374 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 356 transitions. [2018-10-14 16:27:22,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:27:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 356 transitions. [2018-10-14 16:27:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-14 16:27:22,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:22,376 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-14 16:27:22,376 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:22,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1909602108, now seen corresponding path program 12 times [2018-10-14 16:27:22,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:23,132 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-14 16:27:23,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:23,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:27:23,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:27:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:27:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:27:23,134 INFO L87 Difference]: Start difference. First operand 353 states and 356 transitions. Second operand 18 states. [2018-10-14 16:27:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:26,625 INFO L93 Difference]: Finished difference Result 407 states and 410 transitions. [2018-10-14 16:27:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:27:26,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 352 [2018-10-14 16:27:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:26,628 INFO L225 Difference]: With dead ends: 407 [2018-10-14 16:27:26,628 INFO L226 Difference]: Without dead ends: 407 [2018-10-14 16:27:26,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:27:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-14 16:27:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 379. [2018-10-14 16:27:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-14 16:27:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 382 transitions. [2018-10-14 16:27:26,638 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 382 transitions. Word has length 352 [2018-10-14 16:27:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:26,639 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 382 transitions. [2018-10-14 16:27:26,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:27:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 382 transitions. [2018-10-14 16:27:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-14 16:27:26,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:26,641 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-14 16:27:26,641 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:26,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash 817265542, now seen corresponding path program 13 times [2018-10-14 16:27:26,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:27,394 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-14 16:27:27,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:27,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:27:27,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:27:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:27:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:27:27,396 INFO L87 Difference]: Start difference. First operand 379 states and 382 transitions. Second operand 16 states. [2018-10-14 16:27:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:28,000 INFO L93 Difference]: Finished difference Result 394 states and 397 transitions. [2018-10-14 16:27:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:27:28,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 367 [2018-10-14 16:27:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:28,003 INFO L225 Difference]: With dead ends: 394 [2018-10-14 16:27:28,004 INFO L226 Difference]: Without dead ends: 394 [2018-10-14 16:27:28,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:27:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-14 16:27:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-10-14 16:27:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-14 16:27:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 397 transitions. [2018-10-14 16:27:28,011 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 397 transitions. Word has length 367 [2018-10-14 16:27:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:28,011 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 397 transitions. [2018-10-14 16:27:28,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:27:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 397 transitions. [2018-10-14 16:27:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-14 16:27:28,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:28,015 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-14 16:27:28,015 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:28,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash -912424352, now seen corresponding path program 14 times [2018-10-14 16:27:28,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:28,572 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-14 16:27:28,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:28,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:27:28,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:27:28,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:27:28,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:27:28,573 INFO L87 Difference]: Start difference. First operand 394 states and 397 transitions. Second operand 20 states. [2018-10-14 16:27:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:29,725 INFO L93 Difference]: Finished difference Result 426 states and 429 transitions. [2018-10-14 16:27:29,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:27:29,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 382 [2018-10-14 16:27:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:29,729 INFO L225 Difference]: With dead ends: 426 [2018-10-14 16:27:29,729 INFO L226 Difference]: Without dead ends: 426 [2018-10-14 16:27:29,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:27:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-14 16:27:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2018-10-14 16:27:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-14 16:27:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 428 transitions. [2018-10-14 16:27:29,737 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 428 transitions. Word has length 382 [2018-10-14 16:27:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:29,737 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 428 transitions. [2018-10-14 16:27:29,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:27:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 428 transitions. [2018-10-14 16:27:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-14 16:27:29,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:29,741 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-14 16:27:29,741 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:29,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:29,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1578042338, now seen corresponding path program 15 times [2018-10-14 16:27:29,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:30,836 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-14 16:27:30,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:30,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:27:30,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:27:30,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:27:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:27:30,838 INFO L87 Difference]: Start difference. First operand 424 states and 428 transitions. Second operand 23 states. [2018-10-14 16:27:31,458 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-14 16:27:32,614 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-10-14 16:27:34,983 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-14 16:27:36,959 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-14 16:27:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:38,084 INFO L93 Difference]: Finished difference Result 551 states and 556 transitions. [2018-10-14 16:27:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 16:27:38,085 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 397 [2018-10-14 16:27:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:38,088 INFO L225 Difference]: With dead ends: 551 [2018-10-14 16:27:38,088 INFO L226 Difference]: Without dead ends: 551 [2018-10-14 16:27:38,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3683 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2620, Invalid=8300, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 16:27:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-10-14 16:27:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 524. [2018-10-14 16:27:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-14 16:27:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 529 transitions. [2018-10-14 16:27:38,100 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 529 transitions. Word has length 397 [2018-10-14 16:27:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:38,100 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 529 transitions. [2018-10-14 16:27:38,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:27:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 529 transitions. [2018-10-14 16:27:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-14 16:27:38,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:38,104 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-14 16:27:38,104 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:38,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:38,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1956671472, now seen corresponding path program 16 times [2018-10-14 16:27:38,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:39,081 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-14 16:27:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:39,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:27:39,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:27:39,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:27:39,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:27:39,083 INFO L87 Difference]: Start difference. First operand 524 states and 529 transitions. Second operand 16 states. [2018-10-14 16:27:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:40,371 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2018-10-14 16:27:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 16:27:40,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 497 [2018-10-14 16:27:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:40,376 INFO L225 Difference]: With dead ends: 574 [2018-10-14 16:27:40,376 INFO L226 Difference]: Without dead ends: 574 [2018-10-14 16:27:40,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:27:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-14 16:27:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 524. [2018-10-14 16:27:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-14 16:27:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 528 transitions. [2018-10-14 16:27:40,385 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 528 transitions. Word has length 497 [2018-10-14 16:27:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:40,386 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 528 transitions. [2018-10-14 16:27:40,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:27:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 528 transitions. [2018-10-14 16:27:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-14 16:27:40,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:40,389 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-14 16:27:40,389 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:40,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:40,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1958584086, now seen corresponding path program 17 times [2018-10-14 16:27:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:41,694 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-14 16:27:41,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:27:41,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:27:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:27:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:27:41,696 INFO L87 Difference]: Start difference. First operand 524 states and 528 transitions. Second operand 23 states. [2018-10-14 16:27:44,606 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-14 16:27:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:45,423 INFO L93 Difference]: Finished difference Result 651 states and 656 transitions. [2018-10-14 16:27:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 16:27:45,423 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 512 [2018-10-14 16:27:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:45,427 INFO L225 Difference]: With dead ends: 651 [2018-10-14 16:27:45,427 INFO L226 Difference]: Without dead ends: 651 [2018-10-14 16:27:45,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1572, Invalid=4280, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:27:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-10-14 16:27:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 624. [2018-10-14 16:27:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-14 16:27:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 629 transitions. [2018-10-14 16:27:45,436 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 629 transitions. Word has length 512 [2018-10-14 16:27:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:45,437 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 629 transitions. [2018-10-14 16:27:45,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:27:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 629 transitions. [2018-10-14 16:27:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-14 16:27:45,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:45,441 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-14 16:27:45,442 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:45,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 942915624, now seen corresponding path program 18 times [2018-10-14 16:27:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:46,277 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-14 16:27:47,888 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-14 16:27:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:27:47,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:27:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:27:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:27:47,890 INFO L87 Difference]: Start difference. First operand 624 states and 629 transitions. Second operand 25 states. [2018-10-14 16:27:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:52,068 INFO L93 Difference]: Finished difference Result 751 states and 757 transitions. [2018-10-14 16:27:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:27:52,069 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 612 [2018-10-14 16:27:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:52,074 INFO L225 Difference]: With dead ends: 751 [2018-10-14 16:27:52,074 INFO L226 Difference]: Without dead ends: 751 [2018-10-14 16:27:52,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1973, Invalid=5509, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:27:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-10-14 16:27:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 724. [2018-10-14 16:27:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-14 16:27:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 730 transitions. [2018-10-14 16:27:52,086 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 730 transitions. Word has length 612 [2018-10-14 16:27:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:52,086 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 730 transitions. [2018-10-14 16:27:52,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:27:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 730 transitions. [2018-10-14 16:27:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-10-14 16:27:52,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:52,093 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-14 16:27:52,093 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:52,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 3190842, now seen corresponding path program 19 times [2018-10-14 16:27:52,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:53,997 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-14 16:27:53,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:53,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:27:53,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:27:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:27:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:27:53,998 INFO L87 Difference]: Start difference. First operand 724 states and 730 transitions. Second operand 27 states. [2018-10-14 16:27:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:59,050 INFO L93 Difference]: Finished difference Result 851 states and 858 transitions. [2018-10-14 16:27:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 16:27:59,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 712 [2018-10-14 16:27:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:59,055 INFO L225 Difference]: With dead ends: 851 [2018-10-14 16:27:59,056 INFO L226 Difference]: Without dead ends: 851 [2018-10-14 16:27:59,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2418, Invalid=6894, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 16:27:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-14 16:27:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 824. [2018-10-14 16:27:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2018-10-14 16:27:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 831 transitions. [2018-10-14 16:27:59,067 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 831 transitions. Word has length 712 [2018-10-14 16:27:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:59,068 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 831 transitions. [2018-10-14 16:27:59,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:27:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 831 transitions. [2018-10-14 16:27:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2018-10-14 16:27:59,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:59,075 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-14 16:27:59,075 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:59,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1942024012, now seen corresponding path program 20 times [2018-10-14 16:27:59,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:00,306 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-14 16:28:00,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:00,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:28:00,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:28:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:28:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:28:00,308 INFO L87 Difference]: Start difference. First operand 824 states and 831 transitions. Second operand 24 states. [2018-10-14 16:28:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:01,626 INFO L93 Difference]: Finished difference Result 901 states and 908 transitions. [2018-10-14 16:28:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:28:01,627 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 812 [2018-10-14 16:28:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:01,632 INFO L225 Difference]: With dead ends: 901 [2018-10-14 16:28:01,632 INFO L226 Difference]: Without dead ends: 901 [2018-10-14 16:28:01,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:28:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-10-14 16:28:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 899. [2018-10-14 16:28:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-14 16:28:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 907 transitions. [2018-10-14 16:28:01,642 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 907 transitions. Word has length 812 [2018-10-14 16:28:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:01,643 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 907 transitions. [2018-10-14 16:28:01,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:28:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 907 transitions. [2018-10-14 16:28:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2018-10-14 16:28:01,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:01,651 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-14 16:28:01,651 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:01,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 298733828, now seen corresponding path program 21 times [2018-10-14 16:28:01,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:04,656 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-14 16:28:04,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:28:04,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:28:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:28:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:28:04,658 INFO L87 Difference]: Start difference. First operand 899 states and 907 transitions. Second operand 31 states. [2018-10-14 16:28:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:15,793 INFO L93 Difference]: Finished difference Result 1041 states and 1050 transitions. [2018-10-14 16:28:15,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-14 16:28:15,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 872 [2018-10-14 16:28:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:15,800 INFO L225 Difference]: With dead ends: 1041 [2018-10-14 16:28:15,800 INFO L226 Difference]: Without dead ends: 1041 [2018-10-14 16:28:15,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12209 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=6628, Invalid=24524, Unknown=0, NotChecked=0, Total=31152 [2018-10-14 16:28:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-10-14 16:28:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1014. [2018-10-14 16:28:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-14 16:28:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1023 transitions. [2018-10-14 16:28:15,818 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1023 transitions. Word has length 872 [2018-10-14 16:28:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:15,819 INFO L481 AbstractCegarLoop]: Abstraction has 1014 states and 1023 transitions. [2018-10-14 16:28:15,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:28:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1023 transitions. [2018-10-14 16:28:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-10-14 16:28:15,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:15,833 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-14 16:28:15,833 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:15,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash -572144972, now seen corresponding path program 22 times [2018-10-14 16:28:15,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:17,054 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-14 16:28:17,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:17,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:28:17,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:28:17,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:28:17,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:28:17,055 INFO L87 Difference]: Start difference. First operand 1014 states and 1023 transitions. Second operand 28 states. [2018-10-14 16:28:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:18,974 INFO L93 Difference]: Finished difference Result 1093 states and 1101 transitions. [2018-10-14 16:28:18,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:28:18,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 987 [2018-10-14 16:28:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:18,978 INFO L225 Difference]: With dead ends: 1093 [2018-10-14 16:28:18,978 INFO L226 Difference]: Without dead ends: 1093 [2018-10-14 16:28:18,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=814, Invalid=3346, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 16:28:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-14 16:28:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1089. [2018-10-14 16:28:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-10-14 16:28:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1099 transitions. [2018-10-14 16:28:18,989 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1099 transitions. Word has length 987 [2018-10-14 16:28:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:18,989 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1099 transitions. [2018-10-14 16:28:18,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:28:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1099 transitions. [2018-10-14 16:28:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-10-14 16:28:18,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:18,999 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-14 16:28:18,999 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:19,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -875195140, now seen corresponding path program 23 times [2018-10-14 16:28:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:20,853 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-14 16:28:20,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:20,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:28:20,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:28:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:28:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:28:20,856 INFO L87 Difference]: Start difference. First operand 1089 states and 1099 transitions. Second operand 36 states. [2018-10-14 16:28:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:23,548 INFO L93 Difference]: Finished difference Result 1153 states and 1161 transitions. [2018-10-14 16:28:23,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:28:23,549 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1047 [2018-10-14 16:28:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:23,553 INFO L225 Difference]: With dead ends: 1153 [2018-10-14 16:28:23,553 INFO L226 Difference]: Without dead ends: 1153 [2018-10-14 16:28:23,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1119, Invalid=4733, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:28:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-14 16:28:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1119. [2018-10-14 16:28:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-14 16:28:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1130 transitions. [2018-10-14 16:28:23,566 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1130 transitions. Word has length 1047 [2018-10-14 16:28:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:23,567 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 1130 transitions. [2018-10-14 16:28:23,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:28:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1130 transitions. [2018-10-14 16:28:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2018-10-14 16:28:23,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:23,577 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-14 16:28:23,577 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:23,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1922725874, now seen corresponding path program 24 times [2018-10-14 16:28:23,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:27,076 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-14 16:28:27,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:27,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:28:27,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:28:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:28:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:28:27,079 INFO L87 Difference]: Start difference. First operand 1119 states and 1130 transitions. Second operand 19 states. [2018-10-14 16:28:28,231 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-10-14 16:28:28,372 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-10-14 16:28:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:29,012 INFO L93 Difference]: Finished difference Result 1243 states and 1256 transitions. [2018-10-14 16:28:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:28:29,012 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1062 [2018-10-14 16:28:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:29,017 INFO L225 Difference]: With dead ends: 1243 [2018-10-14 16:28:29,017 INFO L226 Difference]: Without dead ends: 1243 [2018-10-14 16:28:29,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=396, Invalid=1164, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:28:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-10-14 16:28:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1119. [2018-10-14 16:28:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-10-14 16:28:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1129 transitions. [2018-10-14 16:28:29,031 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1129 transitions. Word has length 1062 [2018-10-14 16:28:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:29,032 INFO L481 AbstractCegarLoop]: Abstraction has 1119 states and 1129 transitions. [2018-10-14 16:28:29,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:28:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1129 transitions. [2018-10-14 16:28:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2018-10-14 16:28:29,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:29,043 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-14 16:28:29,043 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:29,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:29,044 INFO L82 PathProgramCache]: Analyzing trace with hash 333769560, now seen corresponding path program 25 times [2018-10-14 16:28:29,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:33,376 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-14 16:28:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:28:33,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:28:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:28:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:28:33,377 INFO L87 Difference]: Start difference. First operand 1119 states and 1129 transitions. Second operand 31 states. [2018-10-14 16:28:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:40,062 INFO L93 Difference]: Finished difference Result 1291 states and 1302 transitions. [2018-10-14 16:28:40,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 16:28:40,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1077 [2018-10-14 16:28:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:40,069 INFO L225 Difference]: With dead ends: 1291 [2018-10-14 16:28:40,069 INFO L226 Difference]: Without dead ends: 1291 [2018-10-14 16:28:40,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4389 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3440, Invalid=10132, Unknown=0, NotChecked=0, Total=13572 [2018-10-14 16:28:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-14 16:28:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1264. [2018-10-14 16:28:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2018-10-14 16:28:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1275 transitions. [2018-10-14 16:28:40,079 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1275 transitions. Word has length 1077 [2018-10-14 16:28:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:40,080 INFO L481 AbstractCegarLoop]: Abstraction has 1264 states and 1275 transitions. [2018-10-14 16:28:40,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:28:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1275 transitions. [2018-10-14 16:28:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-10-14 16:28:40,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:40,094 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-14 16:28:40,094 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:40,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1784176444, now seen corresponding path program 26 times [2018-10-14 16:28:40,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:44,758 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-14 16:28:44,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:44,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:28:44,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:28:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:28:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:28:44,760 INFO L87 Difference]: Start difference. First operand 1264 states and 1275 transitions. Second operand 35 states. [2018-10-14 16:28:48,654 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-14 16:28:58,254 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-14 16:29:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:02,202 INFO L93 Difference]: Finished difference Result 1436 states and 1448 transitions. [2018-10-14 16:29:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-14 16:29:02,202 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1222 [2018-10-14 16:29:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:02,208 INFO L225 Difference]: With dead ends: 1436 [2018-10-14 16:29:02,208 INFO L226 Difference]: Without dead ends: 1436 [2018-10-14 16:29:02,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20146 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=9090, Invalid=40862, Unknown=0, NotChecked=0, Total=49952 [2018-10-14 16:29:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-10-14 16:29:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1409. [2018-10-14 16:29:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1409 states. [2018-10-14 16:29:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1421 transitions. [2018-10-14 16:29:02,222 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1421 transitions. Word has length 1222 [2018-10-14 16:29:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:02,223 INFO L481 AbstractCegarLoop]: Abstraction has 1409 states and 1421 transitions. [2018-10-14 16:29:02,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:29:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1421 transitions. [2018-10-14 16:29:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1368 [2018-10-14 16:29:02,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:02,237 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-14 16:29:02,238 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:02,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:02,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1776226344, now seen corresponding path program 27 times [2018-10-14 16:29:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:04,607 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-14 16:29:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:29:04,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:29:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:29:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:29:04,609 INFO L87 Difference]: Start difference. First operand 1409 states and 1421 transitions. Second operand 34 states. [2018-10-14 16:29:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:06,792 INFO L93 Difference]: Finished difference Result 1495 states and 1505 transitions. [2018-10-14 16:29:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 16:29:06,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1367 [2018-10-14 16:29:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:06,797 INFO L225 Difference]: With dead ends: 1495 [2018-10-14 16:29:06,797 INFO L226 Difference]: Without dead ends: 1495 [2018-10-14 16:29:06,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1016, Invalid=4240, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 16:29:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2018-10-14 16:29:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1424. [2018-10-14 16:29:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2018-10-14 16:29:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1436 transitions. [2018-10-14 16:29:06,808 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1436 transitions. Word has length 1367 [2018-10-14 16:29:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:06,808 INFO L481 AbstractCegarLoop]: Abstraction has 1424 states and 1436 transitions. [2018-10-14 16:29:06,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:29:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1436 transitions. [2018-10-14 16:29:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1383 [2018-10-14 16:29:06,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:06,825 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-14 16:29:06,825 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:06,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1972908722, now seen corresponding path program 28 times [2018-10-14 16:29:06,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:12,229 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-14 16:29:12,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:12,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:29:12,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:29:12,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:29:12,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:29:12,231 INFO L87 Difference]: Start difference. First operand 1424 states and 1436 transitions. Second operand 37 states. [2018-10-14 16:29:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:28,877 INFO L93 Difference]: Finished difference Result 1596 states and 1609 transitions. [2018-10-14 16:29:28,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-14 16:29:28,878 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 1382 [2018-10-14 16:29:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:28,883 INFO L225 Difference]: With dead ends: 1596 [2018-10-14 16:29:28,884 INFO L226 Difference]: Without dead ends: 1596 [2018-10-14 16:29:28,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21848 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=10768, Invalid=42362, Unknown=0, NotChecked=0, Total=53130 [2018-10-14 16:29:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-14 16:29:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1569. [2018-10-14 16:29:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2018-10-14 16:29:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1582 transitions. [2018-10-14 16:29:28,899 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1582 transitions. Word has length 1382 [2018-10-14 16:29:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:28,900 INFO L481 AbstractCegarLoop]: Abstraction has 1569 states and 1582 transitions. [2018-10-14 16:29:28,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:29:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1582 transitions. [2018-10-14 16:29:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1528 [2018-10-14 16:29:28,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:28,919 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-14 16:29:28,919 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:28,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash 673990662, now seen corresponding path program 29 times [2018-10-14 16:29:28,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:35,367 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-14 16:29:35,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:35,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:29:35,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:29:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:29:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:29:35,369 INFO L87 Difference]: Start difference. First operand 1569 states and 1582 transitions. Second operand 39 states. [2018-10-14 16:29:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:53,864 INFO L93 Difference]: Finished difference Result 1741 states and 1755 transitions. [2018-10-14 16:29:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-14 16:29:53,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1527 [2018-10-14 16:29:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:53,870 INFO L225 Difference]: With dead ends: 1741 [2018-10-14 16:29:53,871 INFO L226 Difference]: Without dead ends: 1741 [2018-10-14 16:29:53,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25679 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=12364, Invalid=49388, Unknown=0, NotChecked=0, Total=61752 [2018-10-14 16:29:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2018-10-14 16:29:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1714. [2018-10-14 16:29:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-10-14 16:29:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 1728 transitions. [2018-10-14 16:29:53,885 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 1728 transitions. Word has length 1527 [2018-10-14 16:29:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:53,886 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 1728 transitions. [2018-10-14 16:29:53,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:29:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1728 transitions. [2018-10-14 16:29:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-14 16:29:53,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:53,903 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-14 16:29:53,904 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:53,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1182340174, now seen corresponding path program 30 times [2018-10-14 16:29:53,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:01,806 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-14 16:30:01,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:01,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:30:01,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:30:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:30:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1385, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:30:01,809 INFO L87 Difference]: Start difference. First operand 1714 states and 1728 transitions. Second operand 41 states. [2018-10-14 16:30:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:21,978 INFO L93 Difference]: Finished difference Result 1886 states and 1901 transitions. [2018-10-14 16:30:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-10-14 16:30:21,978 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1672 [2018-10-14 16:30:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:21,984 INFO L225 Difference]: With dead ends: 1886 [2018-10-14 16:30:21,984 INFO L226 Difference]: Without dead ends: 1886 [2018-10-14 16:30:21,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29819 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=14068, Invalid=56954, Unknown=0, NotChecked=0, Total=71022 [2018-10-14 16:30:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-10-14 16:30:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1859. [2018-10-14 16:30:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1859 states. [2018-10-14 16:30:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 1874 transitions. [2018-10-14 16:30:22,002 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 1874 transitions. Word has length 1672 [2018-10-14 16:30:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:22,003 INFO L481 AbstractCegarLoop]: Abstraction has 1859 states and 1874 transitions. [2018-10-14 16:30:22,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:30:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 1874 transitions. [2018-10-14 16:30:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2018-10-14 16:30:22,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:22,024 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-14 16:30:22,024 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:22,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 862052614, now seen corresponding path program 31 times [2018-10-14 16:30:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:25,726 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-14 16:30:25,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:25,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:30:25,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:30:25,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:30:25,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:30:25,728 INFO L87 Difference]: Start difference. First operand 1859 states and 1874 transitions. Second operand 44 states. [2018-10-14 16:30:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:29,253 INFO L93 Difference]: Finished difference Result 1979 states and 1992 transitions. [2018-10-14 16:30:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 16:30:29,254 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1817 [2018-10-14 16:30:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:29,260 INFO L225 Difference]: With dead ends: 1979 [2018-10-14 16:30:29,260 INFO L226 Difference]: Without dead ends: 1979 [2018-10-14 16:30:29,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1654, Invalid=7088, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 16:30:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-10-14 16:30:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1919. [2018-10-14 16:30:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2018-10-14 16:30:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 1935 transitions. [2018-10-14 16:30:29,274 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 1935 transitions. Word has length 1817 [2018-10-14 16:30:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:29,275 INFO L481 AbstractCegarLoop]: Abstraction has 1919 states and 1935 transitions. [2018-10-14 16:30:29,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:30:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 1935 transitions. [2018-10-14 16:30:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1863 [2018-10-14 16:30:29,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:29,297 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-14 16:30:29,297 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:29,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash 71961304, now seen corresponding path program 32 times [2018-10-14 16:30:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:33,578 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-14 16:30:33,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:33,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:30:33,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:30:33,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:30:33,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:30:33,581 INFO L87 Difference]: Start difference. First operand 1919 states and 1935 transitions. Second operand 42 states. [2018-10-14 16:30:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:36,766 INFO L93 Difference]: Finished difference Result 2007 states and 2020 transitions. [2018-10-14 16:30:36,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 16:30:36,766 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1862 [2018-10-14 16:30:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:36,772 INFO L225 Difference]: With dead ends: 2007 [2018-10-14 16:30:36,772 INFO L226 Difference]: Without dead ends: 2007 [2018-10-14 16:30:36,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1518, Invalid=6492, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 16:30:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2018-10-14 16:30:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1934. [2018-10-14 16:30:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-10-14 16:30:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 1950 transitions. [2018-10-14 16:30:36,787 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 1950 transitions. Word has length 1862 [2018-10-14 16:30:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:36,787 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 1950 transitions. [2018-10-14 16:30:36,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:30:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 1950 transitions. [2018-10-14 16:30:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1878 [2018-10-14 16:30:36,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:36,807 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-14 16:30:36,807 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:36,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:36,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1408255042, now seen corresponding path program 33 times [2018-10-14 16:30:36,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:46,434 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-14 16:30:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:30:46,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:30:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:30:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1685, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:30:46,436 INFO L87 Difference]: Start difference. First operand 1934 states and 1950 transitions. Second operand 45 states. [2018-10-14 16:31:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:12,265 INFO L93 Difference]: Finished difference Result 2121 states and 2138 transitions. [2018-10-14 16:31:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2018-10-14 16:31:12,265 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1877 [2018-10-14 16:31:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:12,272 INFO L225 Difference]: With dead ends: 2121 [2018-10-14 16:31:12,273 INFO L226 Difference]: Without dead ends: 2121 [2018-10-14 16:31:12,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45915 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=18776, Invalid=87174, Unknown=0, NotChecked=0, Total=105950 [2018-10-14 16:31:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2018-10-14 16:31:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2094. [2018-10-14 16:31:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2018-10-14 16:31:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2111 transitions. [2018-10-14 16:31:12,291 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2111 transitions. Word has length 1877 [2018-10-14 16:31:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:12,292 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 2111 transitions. [2018-10-14 16:31:12,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:31:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2111 transitions. [2018-10-14 16:31:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2038 [2018-10-14 16:31:12,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:12,315 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-14 16:31:12,316 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:12,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1222431468, now seen corresponding path program 34 times [2018-10-14 16:31:12,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:22,855 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-14 16:31:22,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:22,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:31:22,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:31:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:31:22,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:31:22,858 INFO L87 Difference]: Start difference. First operand 2094 states and 2111 transitions. Second operand 43 states. [2018-10-14 16:31:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:35,515 INFO L93 Difference]: Finished difference Result 2281 states and 2299 transitions. [2018-10-14 16:31:35,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-14 16:31:35,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2037 [2018-10-14 16:31:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:35,525 INFO L225 Difference]: With dead ends: 2281 [2018-10-14 16:31:35,525 INFO L226 Difference]: Without dead ends: 2281 [2018-10-14 16:31:35,528 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-14 16:31:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2018-10-14 16:31:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2254. [2018-10-14 16:31:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-10-14 16:31:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2272 transitions. [2018-10-14 16:31:35,549 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2272 transitions. Word has length 2037 [2018-10-14 16:31:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:35,551 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 2272 transitions. [2018-10-14 16:31:35,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:31:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2272 transitions. [2018-10-14 16:31:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2198 [2018-10-14 16:31:35,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:35,582 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-14 16:31:35,582 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:35,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1873859098, now seen corresponding path program 35 times [2018-10-14 16:31:35,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:47,281 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-14 16:31:47,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:47,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:31:47,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:31:47,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:31:47,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1633, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:31:47,283 INFO L87 Difference]: Start difference. First operand 2254 states and 2272 transitions. Second operand 45 states. [2018-10-14 16:32:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:01,160 INFO L93 Difference]: Finished difference Result 2441 states and 2460 transitions. [2018-10-14 16:32:01,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-14 16:32:01,160 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 2197 [2018-10-14 16:32:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:01,168 INFO L225 Difference]: With dead ends: 2441 [2018-10-14 16:32:01,168 INFO L226 Difference]: Without dead ends: 2441 [2018-10-14 16:32:01,172 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-14 16:32:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2018-10-14 16:32:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2414. [2018-10-14 16:32:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2414 states. [2018-10-14 16:32:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2433 transitions. [2018-10-14 16:32:01,194 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2433 transitions. Word has length 2197 [2018-10-14 16:32:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:01,196 INFO L481 AbstractCegarLoop]: Abstraction has 2414 states and 2433 transitions. [2018-10-14 16:32:01,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:32:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2433 transitions. [2018-10-14 16:32:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2358 [2018-10-14 16:32:01,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:01,233 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-14 16:32:01,233 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:01,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1268008632, now seen corresponding path program 36 times [2018-10-14 16:32:01,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:14,734 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-14 16:32:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:14,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:32:14,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:32:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:32:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1961, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:32:14,736 INFO L87 Difference]: Start difference. First operand 2414 states and 2433 transitions. Second operand 49 states. [2018-10-14 16:32:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:44,453 INFO L93 Difference]: Finished difference Result 2601 states and 2621 transitions. [2018-10-14 16:32:44,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 294 states. [2018-10-14 16:32:44,453 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2357 [2018-10-14 16:32:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:44,458 INFO L225 Difference]: With dead ends: 2601 [2018-10-14 16:32:44,458 INFO L226 Difference]: Without dead ends: 2601 [2018-10-14 16:32:44,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49469 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=21964, Invalid=92618, Unknown=0, NotChecked=0, Total=114582 [2018-10-14 16:32:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2018-10-14 16:32:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2574. [2018-10-14 16:32:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2018-10-14 16:32:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 2594 transitions. [2018-10-14 16:32:44,485 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 2594 transitions. Word has length 2357 [2018-10-14 16:32:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:44,487 INFO L481 AbstractCegarLoop]: Abstraction has 2574 states and 2594 transitions. [2018-10-14 16:32:44,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:32:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 2594 transitions. [2018-10-14 16:32:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2518 [2018-10-14 16:32:44,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:44,523 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-14 16:32:44,523 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:44,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash 720210038, now seen corresponding path program 37 times [2018-10-14 16:32:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:59,046 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-14 16:32:59,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:59,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:32:59,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:32:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:32:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1929, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:32:59,048 INFO L87 Difference]: Start difference. First operand 2574 states and 2594 transitions. Second operand 49 states. [2018-10-14 16:33:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:14,826 INFO L93 Difference]: Finished difference Result 2761 states and 2782 transitions. [2018-10-14 16:33:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-14 16:33:14,826 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 2517 [2018-10-14 16:33:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:14,832 INFO L225 Difference]: With dead ends: 2761 [2018-10-14 16:33:14,832 INFO L226 Difference]: Without dead ends: 2761 [2018-10-14 16:33:14,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15198 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=10217, Invalid=32425, Unknown=0, NotChecked=0, Total=42642 [2018-10-14 16:33:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2018-10-14 16:33:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2734. [2018-10-14 16:33:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-10-14 16:33:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 2755 transitions. [2018-10-14 16:33:14,853 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 2755 transitions. Word has length 2517 [2018-10-14 16:33:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:14,854 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 2755 transitions. [2018-10-14 16:33:14,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:33:14,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 2755 transitions. [2018-10-14 16:33:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2678 [2018-10-14 16:33:14,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:14,894 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-14 16:33:14,895 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:14,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1729511332, now seen corresponding path program 38 times [2018-10-14 16:33:14,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:30,977 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-14 16:33:30,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:30,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:33:30,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:33:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:33:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2086, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:33:30,980 INFO L87 Difference]: Start difference. First operand 2734 states and 2755 transitions. Second operand 51 states. [2018-10-14 16:33:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:48,466 INFO L93 Difference]: Finished difference Result 2921 states and 2943 transitions. [2018-10-14 16:33:48,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-14 16:33:48,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 2677 [2018-10-14 16:33:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:48,471 INFO L225 Difference]: With dead ends: 2921 [2018-10-14 16:33:48,471 INFO L226 Difference]: Without dead ends: 2921 [2018-10-14 16:33:48,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16799 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=11190, Invalid=35682, Unknown=0, NotChecked=0, Total=46872 [2018-10-14 16:33:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-10-14 16:33:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2894. [2018-10-14 16:33:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2018-10-14 16:33:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 2916 transitions. [2018-10-14 16:33:48,493 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 2916 transitions. Word has length 2677 [2018-10-14 16:33:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:48,494 INFO L481 AbstractCegarLoop]: Abstraction has 2894 states and 2916 transitions. [2018-10-14 16:33:48,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:33:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 2916 transitions. [2018-10-14 16:33:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2838 [2018-10-14 16:33:48,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:48,558 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-14 16:33:48,559 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:48,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:48,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2093342418, now seen corresponding path program 39 times [2018-10-14 16:33:48,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:54,510 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-14 16:33:54,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:54,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:33:54,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:33:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:33:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2478, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:33:54,512 INFO L87 Difference]: Start difference. First operand 2894 states and 2916 transitions. Second operand 54 states. [2018-10-14 16:33:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:59,377 INFO L93 Difference]: Finished difference Result 3072 states and 3091 transitions. [2018-10-14 16:33:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 16:33:59,378 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2837 [2018-10-14 16:33:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:59,383 INFO L225 Difference]: With dead ends: 3072 [2018-10-14 16:33:59,383 INFO L226 Difference]: Without dead ends: 3072 [2018-10-14 16:33:59,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2490, Invalid=10620, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 16:33:59,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-14 16:33:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2984. [2018-10-14 16:33:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2018-10-14 16:33:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3007 transitions. [2018-10-14 16:33:59,407 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3007 transitions. Word has length 2837 [2018-10-14 16:33:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:59,408 INFO L481 AbstractCegarLoop]: Abstraction has 2984 states and 3007 transitions. [2018-10-14 16:33:59,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:33:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3007 transitions. [2018-10-14 16:33:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2913 [2018-10-14 16:33:59,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:59,464 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-14 16:33:59,464 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:59,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 457162472, now seen corresponding path program 40 times [2018-10-14 16:33:59,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:04,833 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-14 16:34:04,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:04,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:34:04,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:34:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:34:04,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:34:04,835 INFO L87 Difference]: Start difference. First operand 2984 states and 3007 transitions. Second operand 40 states. [2018-10-14 16:34:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:07,209 INFO L93 Difference]: Finished difference Result 3085 states and 3104 transitions. [2018-10-14 16:34:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 16:34:07,210 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2912 [2018-10-14 16:34:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:07,214 INFO L225 Difference]: With dead ends: 3085 [2018-10-14 16:34:07,214 INFO L226 Difference]: Without dead ends: 3085 [2018-10-14 16:34:07,215 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-14 16:34:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2018-10-14 16:34:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2999. [2018-10-14 16:34:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-14 16:34:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3022 transitions. [2018-10-14 16:34:07,239 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3022 transitions. Word has length 2912 [2018-10-14 16:34:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:07,240 INFO L481 AbstractCegarLoop]: Abstraction has 2999 states and 3022 transitions. [2018-10-14 16:34:07,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:34:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3022 transitions. [2018-10-14 16:34:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2928 [2018-10-14 16:34:07,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:07,305 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-14 16:34:07,305 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:07,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:07,306 INFO L82 PathProgramCache]: Analyzing trace with hash -827790670, now seen corresponding path program 41 times [2018-10-14 16:34:07,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:13,845 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-14 16:34:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:13,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:34:13,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:34:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:34:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:34:13,847 INFO L87 Difference]: Start difference. First operand 2999 states and 3022 transitions. Second operand 52 states. [2018-10-14 16:34:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:34:18,394 INFO L93 Difference]: Finished difference Result 3115 states and 3134 transitions. [2018-10-14 16:34:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 16:34:18,395 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2927 [2018-10-14 16:34:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:34:18,399 INFO L225 Difference]: With dead ends: 3115 [2018-10-14 16:34:18,399 INFO L226 Difference]: Without dead ends: 3115 [2018-10-14 16:34:18,400 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-14 16:34:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2018-10-14 16:34:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3014. [2018-10-14 16:34:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2018-10-14 16:34:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 3037 transitions. [2018-10-14 16:34:18,425 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 3037 transitions. Word has length 2927 [2018-10-14 16:34:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:34:18,426 INFO L481 AbstractCegarLoop]: Abstraction has 3014 states and 3037 transitions. [2018-10-14 16:34:18,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:34:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3037 transitions. [2018-10-14 16:34:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2943 [2018-10-14 16:34:18,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:34:18,487 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-14 16:34:18,487 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:34:18,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:34:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash -856020556, now seen corresponding path program 42 times [2018-10-14 16:34:18,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:34:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:34:37,879 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-14 16:34:37,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:34:37,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 16:34:37,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 16:34:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 16:34:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:34:37,881 INFO L87 Difference]: Start difference. First operand 3014 states and 3037 transitions. Second operand 55 states. [2018-10-14 16:35:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:15,010 INFO L93 Difference]: Finished difference Result 3216 states and 3240 transitions. [2018-10-14 16:35:15,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2018-10-14 16:35:15,010 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 2942 [2018-10-14 16:35:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:15,014 INFO L225 Difference]: With dead ends: 3216 [2018-10-14 16:35:15,014 INFO L226 Difference]: Without dead ends: 3216 [2018-10-14 16:35:15,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67451 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=29020, Invalid=125036, Unknown=0, NotChecked=0, Total=154056 [2018-10-14 16:35:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2018-10-14 16:35:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3189. [2018-10-14 16:35:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2018-10-14 16:35:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 3213 transitions. [2018-10-14 16:35:15,036 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 3213 transitions. Word has length 2942 [2018-10-14 16:35:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:15,037 INFO L481 AbstractCegarLoop]: Abstraction has 3189 states and 3213 transitions. [2018-10-14 16:35:15,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 16:35:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 3213 transitions. [2018-10-14 16:35:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3118 [2018-10-14 16:35:15,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:15,086 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-14 16:35:15,086 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:15,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1762922528, now seen corresponding path program 43 times [2018-10-14 16:35:15,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:21,834 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-14 16:35:21,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:35:21,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:35:21,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:35:21,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:35:21,837 INFO L87 Difference]: Start difference. First operand 3189 states and 3213 transitions. Second operand 48 states. [2018-10-14 16:35:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:25,303 INFO L93 Difference]: Finished difference Result 3359 states and 3379 transitions. [2018-10-14 16:35:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:35:25,304 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3117 [2018-10-14 16:35:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:25,307 INFO L225 Difference]: With dead ends: 3359 [2018-10-14 16:35:25,307 INFO L226 Difference]: Without dead ends: 3359 [2018-10-14 16:35:25,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1983, Invalid=8523, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 16:35:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2018-10-14 16:35:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3219. [2018-10-14 16:35:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2018-10-14 16:35:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 3243 transitions. [2018-10-14 16:35:25,328 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 3243 transitions. Word has length 3117 [2018-10-14 16:35:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:25,329 INFO L481 AbstractCegarLoop]: Abstraction has 3219 states and 3243 transitions. [2018-10-14 16:35:25,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:35:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 3243 transitions. [2018-10-14 16:35:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3148 [2018-10-14 16:35:25,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:25,378 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-14 16:35:25,378 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:25,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash -350180484, now seen corresponding path program 44 times [2018-10-14 16:35:25,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:31,611 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-14 16:35:31,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:31,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:35:31,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:35:31,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:35:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:35:31,613 INFO L87 Difference]: Start difference. First operand 3219 states and 3243 transitions. Second operand 36 states. [2018-10-14 16:35:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:35:34,726 INFO L93 Difference]: Finished difference Result 3255 states and 3276 transitions. [2018-10-14 16:35:34,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 16:35:34,726 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 3147 [2018-10-14 16:35:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:35:34,728 INFO L225 Difference]: With dead ends: 3255 [2018-10-14 16:35:34,728 INFO L226 Difference]: Without dead ends: 3255 [2018-10-14 16:35:34,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=5762, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 16:35:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2018-10-14 16:35:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3249. [2018-10-14 16:35:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3249 states. [2018-10-14 16:35:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 3273 transitions. [2018-10-14 16:35:34,745 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 3273 transitions. Word has length 3147 [2018-10-14 16:35:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:35:34,746 INFO L481 AbstractCegarLoop]: Abstraction has 3249 states and 3273 transitions. [2018-10-14 16:35:34,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:35:34,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 3273 transitions. [2018-10-14 16:35:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3178 [2018-10-14 16:35:34,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:35:34,798 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-14 16:35:34,798 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:35:34,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:35:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash -982770528, now seen corresponding path program 45 times [2018-10-14 16:35:34,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:35:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:35:43,452 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-14 16:35:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:35:43,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:35:43,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:35:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:35:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=592, Invalid=3698, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:35:43,455 INFO L87 Difference]: Start difference. First operand 3249 states and 3273 transitions. Second operand 66 states.