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/20051113-1.c_false-valid-memtrack.i_40.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:18:12,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:18:12,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:18:12,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:18:12,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:18:12,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:18:12,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:18:12,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:18:12,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:18:12,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:18:12,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:18:12,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:18:12,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:18:12,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:18:12,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:18:12,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:18:12,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:18:12,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:18:12,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:18:12,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:18:12,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:18:12,528 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:18:12,531 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:18:12,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:18:12,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:18:12,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:18:12,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:18:12,535 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:18:12,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:18:12,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:18:12,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:18:12,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:18:12,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:18:12,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:18:12,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:18:12,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:18:12,540 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:18:12,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:18:12,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:18:12,552 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:18:12,552 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:18:12,552 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:18:12,552 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:18:12,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:18:12,553 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:18:12,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:18:12,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:18:12,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:18:12,554 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:18:12,554 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:18:12,555 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:18:12,556 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:18:12,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:18:12,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:18:12,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:18:12,615 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:18:12,615 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:18:12,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_40.bpl [2018-10-14 16:18:12,616 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_40.bpl' [2018-10-14 16:18:12,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:18:12,692 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:18:12,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:18:12,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:18:12,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:18:12,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/1) ... [2018-10-14 16:18:12,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:18:12,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:18:12,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:18:12,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:18:12,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (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:18:12,868 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:18:12,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:18:12,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:18:13,820 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:18:13,821 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:18:13 BoogieIcfgContainer [2018-10-14 16:18:13,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:18:13,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:18:13,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:18:13,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:18:13,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:18:12" (1/2) ... [2018-10-14 16:18:13,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d936623 and model type 20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:18:13, skipping insertion in model container [2018-10-14 16:18:13,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:18:13" (2/2) ... [2018-10-14 16:18:13,829 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_40.bpl [2018-10-14 16:18:13,838 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:18:13,847 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:18:13,864 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:18:13,890 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:18:13,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:18:13,891 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:18:13,891 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:18:13,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:18:13,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:18:13,892 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:18:13,892 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:18:13,892 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:18:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-10-14 16:18:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-14 16:18:13,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:13,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:13,932 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:13,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1195130988, now seen corresponding path program 1 times [2018-10-14 16:18:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:14,367 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:18:14,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:18:14,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 16:18:14,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 16:18:14,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 16:18:14,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:18:14,396 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 4 states. [2018-10-14 16:18:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:14,499 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-14 16:18:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 16:18:14,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-10-14 16:18:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:14,516 INFO L225 Difference]: With dead ends: 145 [2018-10-14 16:18:14,516 INFO L226 Difference]: Without dead ends: 145 [2018-10-14 16:18:14,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:18:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-14 16:18:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-10-14 16:18:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-14 16:18:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-14 16:18:14,570 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-10-14 16:18:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:14,570 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-14 16:18:14,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 16:18:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-14 16:18:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-14 16:18:14,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:14,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:14,575 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:14,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:14,576 INFO L82 PathProgramCache]: Analyzing trace with hash -836822646, now seen corresponding path program 1 times [2018-10-14 16:18:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:14,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:14,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:18:14,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:18:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:18:14,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:18:14,834 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 5 states. [2018-10-14 16:18:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:15,002 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-14 16:18:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 16:18:15,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-14 16:18:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:15,006 INFO L225 Difference]: With dead ends: 148 [2018-10-14 16:18:15,006 INFO L226 Difference]: Without dead ends: 148 [2018-10-14 16:18:15,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:18:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-14 16:18:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-10-14 16:18:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-14 16:18:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-14 16:18:15,021 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-10-14 16:18:15,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:15,021 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-14 16:18:15,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:18:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-14 16:18:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-14 16:18:15,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:15,025 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,025 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:15,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1498463316, now seen corresponding path program 2 times [2018-10-14 16:18:15,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:15,219 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:18:15,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:15,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 16:18:15,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:18:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:18:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:18:15,222 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 6 states. [2018-10-14 16:18:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:15,534 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-14 16:18:15,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:18:15,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-10-14 16:18:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:15,537 INFO L225 Difference]: With dead ends: 151 [2018-10-14 16:18:15,537 INFO L226 Difference]: Without dead ends: 151 [2018-10-14 16:18:15,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:18:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-14 16:18:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-10-14 16:18:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-14 16:18:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-14 16:18:15,549 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-10-14 16:18:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:15,550 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-14 16:18:15,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:18:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-14 16:18:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-14 16:18:15,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:15,553 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,553 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:15,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1464225354, now seen corresponding path program 3 times [2018-10-14 16:18:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:15,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:15,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:18:15,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:18:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:18:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:18:15,810 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 7 states. [2018-10-14 16:18:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:16,335 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-14 16:18:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 16:18:16,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 148 [2018-10-14 16:18:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:16,338 INFO L225 Difference]: With dead ends: 154 [2018-10-14 16:18:16,339 INFO L226 Difference]: Without dead ends: 154 [2018-10-14 16:18:16,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:18:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-14 16:18:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-10-14 16:18:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-14 16:18:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-14 16:18:16,364 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-10-14 16:18:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:16,365 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-14 16:18:16,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:18:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-14 16:18:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-14 16:18:16,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:16,371 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:16,374 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:16,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1344460524, now seen corresponding path program 4 times [2018-10-14 16:18:16,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:16,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:16,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:18:16,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:18:16,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:18:16,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:18:16,821 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 8 states. [2018-10-14 16:18:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:16,959 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-14 16:18:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:18:16,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2018-10-14 16:18:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:16,962 INFO L225 Difference]: With dead ends: 157 [2018-10-14 16:18:16,962 INFO L226 Difference]: Without dead ends: 157 [2018-10-14 16:18:16,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:18:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-14 16:18:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-14 16:18:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 16:18:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-14 16:18:16,979 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-10-14 16:18:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:16,979 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-14 16:18:16,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:18:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-14 16:18:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-14 16:18:16,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:16,987 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:16,988 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:16,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1746734326, now seen corresponding path program 5 times [2018-10-14 16:18:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:17,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:17,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:18:17,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:18:17,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:18:17,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:18:17,499 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 9 states. [2018-10-14 16:18:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:17,713 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-14 16:18:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:18:17,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 154 [2018-10-14 16:18:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:17,715 INFO L225 Difference]: With dead ends: 160 [2018-10-14 16:18:17,715 INFO L226 Difference]: Without dead ends: 160 [2018-10-14 16:18:17,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:18:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-14 16:18:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-14 16:18:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-14 16:18:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-14 16:18:17,723 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-10-14 16:18:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:17,724 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-14 16:18:17,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:18:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-14 16:18:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-14 16:18:17,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:17,727 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:17,727 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:17,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1156250156, now seen corresponding path program 6 times [2018-10-14 16:18:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:18,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:18,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:18:18,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:18:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:18:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:18:18,034 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 10 states. [2018-10-14 16:18:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:18,244 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-14 16:18:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:18:18,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2018-10-14 16:18:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:18,253 INFO L225 Difference]: With dead ends: 163 [2018-10-14 16:18:18,253 INFO L226 Difference]: Without dead ends: 163 [2018-10-14 16:18:18,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:18:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-14 16:18:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-14 16:18:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-14 16:18:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-14 16:18:18,259 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-10-14 16:18:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:18,260 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-14 16:18:18,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:18:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-14 16:18:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-14 16:18:18,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:18,263 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:18,263 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:18,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash 505481162, now seen corresponding path program 7 times [2018-10-14 16:18:18,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:18,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:18:18,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:18:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:18:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:18:18,452 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 11 states. [2018-10-14 16:18:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:18,864 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-14 16:18:18,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:18:18,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-10-14 16:18:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:18,872 INFO L225 Difference]: With dead ends: 166 [2018-10-14 16:18:18,873 INFO L226 Difference]: Without dead ends: 166 [2018-10-14 16:18:18,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:18:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-14 16:18:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-10-14 16:18:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-14 16:18:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-14 16:18:18,878 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-10-14 16:18:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:18,879 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-14 16:18:18,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:18:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-14 16:18:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-14 16:18:18,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:18,882 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:18,882 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:18,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 928755052, now seen corresponding path program 8 times [2018-10-14 16:18:18,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:19,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:18:19,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:18:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:18:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:18:19,278 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 12 states. [2018-10-14 16:18:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:19,536 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-14 16:18:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:18:19,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2018-10-14 16:18:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:19,540 INFO L225 Difference]: With dead ends: 169 [2018-10-14 16:18:19,540 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 16:18:19,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:18:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 16:18:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-14 16:18:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-14 16:18:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-14 16:18:19,549 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-10-14 16:18:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:19,550 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-14 16:18:19,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:18:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-14 16:18:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-14 16:18:19,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:19,560 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,561 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:19,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash 657230986, now seen corresponding path program 9 times [2018-10-14 16:18:19,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:19,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:19,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:18:19,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:18:19,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:18:19,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:18:19,991 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 13 states. [2018-10-14 16:18:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:20,223 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-14 16:18:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:18:20,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 166 [2018-10-14 16:18:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:20,228 INFO L225 Difference]: With dead ends: 172 [2018-10-14 16:18:20,228 INFO L226 Difference]: Without dead ends: 172 [2018-10-14 16:18:20,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:18:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-14 16:18:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-14 16:18:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-14 16:18:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-14 16:18:20,232 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-10-14 16:18:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:20,233 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-14 16:18:20,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:18:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-14 16:18:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-14 16:18:20,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:20,235 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,235 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:20,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash -892800852, now seen corresponding path program 10 times [2018-10-14 16:18:20,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:20,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:18:20,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:18:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:18:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:18:20,484 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 14 states. [2018-10-14 16:18:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:20,787 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-14 16:18:20,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 16:18:20,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 169 [2018-10-14 16:18:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:20,790 INFO L225 Difference]: With dead ends: 175 [2018-10-14 16:18:20,790 INFO L226 Difference]: Without dead ends: 175 [2018-10-14 16:18:20,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:18:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-14 16:18:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-10-14 16:18:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-14 16:18:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-14 16:18:20,795 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-10-14 16:18:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:20,795 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-14 16:18:20,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:18:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-14 16:18:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-14 16:18:20,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:20,797 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,797 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:20,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:20,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1597079882, now seen corresponding path program 11 times [2018-10-14 16:18:20,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:21,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:21,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:18:21,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:18:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:18:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:18:21,637 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 15 states. [2018-10-14 16:18:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:22,104 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-14 16:18:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:18:22,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2018-10-14 16:18:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:22,107 INFO L225 Difference]: With dead ends: 178 [2018-10-14 16:18:22,107 INFO L226 Difference]: Without dead ends: 178 [2018-10-14 16:18:22,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:18:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-14 16:18:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-14 16:18:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-14 16:18:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-14 16:18:22,113 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-10-14 16:18:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:22,114 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-14 16:18:22,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:18:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-14 16:18:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-14 16:18:22,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:22,115 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:22,115 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:22,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash -746142740, now seen corresponding path program 12 times [2018-10-14 16:18:22,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:23,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:23,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:18:23,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:18:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:18:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:18:23,003 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 16 states. [2018-10-14 16:18:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:23,257 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-14 16:18:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:18:23,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 175 [2018-10-14 16:18:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:23,259 INFO L225 Difference]: With dead ends: 181 [2018-10-14 16:18:23,259 INFO L226 Difference]: Without dead ends: 181 [2018-10-14 16:18:23,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:18:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-14 16:18:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-10-14 16:18:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-14 16:18:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-14 16:18:23,264 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-10-14 16:18:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:23,264 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-14 16:18:23,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:18:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-14 16:18:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-14 16:18:23,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:23,266 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,266 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:23,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1587812854, now seen corresponding path program 13 times [2018-10-14 16:18:23,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:23,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:23,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 16:18:23,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 16:18:23,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 16:18:23,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-14 16:18:23,589 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 17 states. [2018-10-14 16:18:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:24,112 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-14 16:18:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 16:18:24,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 178 [2018-10-14 16:18:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:24,114 INFO L225 Difference]: With dead ends: 184 [2018-10-14 16:18:24,114 INFO L226 Difference]: Without dead ends: 184 [2018-10-14 16:18:24,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:18:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-14 16:18:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-10-14 16:18:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-14 16:18:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-14 16:18:24,119 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-10-14 16:18:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:24,119 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-14 16:18:24,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 16:18:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-14 16:18:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-14 16:18:24,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:24,121 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:24,121 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:24,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1763104980, now seen corresponding path program 14 times [2018-10-14 16:18:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:24,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:24,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:18:24,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:18:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:18:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:18:24,409 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 18 states. [2018-10-14 16:18:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:24,849 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-14 16:18:24,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 16:18:24,849 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 181 [2018-10-14 16:18:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:24,850 INFO L225 Difference]: With dead ends: 187 [2018-10-14 16:18:24,850 INFO L226 Difference]: Without dead ends: 187 [2018-10-14 16:18:24,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:18:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-14 16:18:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-10-14 16:18:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-14 16:18:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-14 16:18:24,855 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-10-14 16:18:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:24,855 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-14 16:18:24,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:18:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-14 16:18:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-14 16:18:24,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:24,856 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:24,857 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:24,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1210598710, now seen corresponding path program 15 times [2018-10-14 16:18:24,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:25,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:25,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:18:25,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:18:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:18:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:18:25,156 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 19 states. [2018-10-14 16:18:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:25,520 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-14 16:18:25,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 16:18:25,521 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 184 [2018-10-14 16:18:25,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:25,522 INFO L225 Difference]: With dead ends: 190 [2018-10-14 16:18:25,522 INFO L226 Difference]: Without dead ends: 190 [2018-10-14 16:18:25,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:18:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-14 16:18:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-14 16:18:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-14 16:18:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-14 16:18:25,527 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-10-14 16:18:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:25,527 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-14 16:18:25,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:18:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-14 16:18:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-14 16:18:25,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:25,528 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,529 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:25,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash 189012588, now seen corresponding path program 16 times [2018-10-14 16:18:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:25,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:25,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 16:18:25,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 16:18:25,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 16:18:25,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:18:25,850 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 20 states. [2018-10-14 16:18:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:26,242 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-14 16:18:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 16:18:26,244 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 187 [2018-10-14 16:18:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:26,245 INFO L225 Difference]: With dead ends: 193 [2018-10-14 16:18:26,245 INFO L226 Difference]: Without dead ends: 193 [2018-10-14 16:18:26,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:18:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-14 16:18:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-10-14 16:18:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-14 16:18:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-14 16:18:26,251 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-10-14 16:18:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:26,251 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-14 16:18:26,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 16:18:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-14 16:18:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-14 16:18:26,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:26,252 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:26,253 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:26,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash 466681738, now seen corresponding path program 17 times [2018-10-14 16:18:26,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:26,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:26,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 16:18:26,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 16:18:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 16:18:26,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-14 16:18:26,815 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 21 states. [2018-10-14 16:18:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:27,337 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-14 16:18:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:18:27,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 190 [2018-10-14 16:18:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:27,338 INFO L225 Difference]: With dead ends: 196 [2018-10-14 16:18:27,338 INFO L226 Difference]: Without dead ends: 196 [2018-10-14 16:18:27,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:18:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-14 16:18:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-14 16:18:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-14 16:18:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-14 16:18:27,343 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-10-14 16:18:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:27,343 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-14 16:18:27,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 16:18:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-14 16:18:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-14 16:18:27,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:27,344 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,345 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 401317292, now seen corresponding path program 18 times [2018-10-14 16:18:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:27,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:27,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:18:27,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:18:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:18:27,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:18:27,821 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 22 states. [2018-10-14 16:18:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:28,310 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-14 16:18:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 16:18:28,310 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 193 [2018-10-14 16:18:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:28,311 INFO L225 Difference]: With dead ends: 199 [2018-10-14 16:18:28,311 INFO L226 Difference]: Without dead ends: 199 [2018-10-14 16:18:28,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:18:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-14 16:18:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-10-14 16:18:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-14 16:18:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-14 16:18:28,316 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-10-14 16:18:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:28,316 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-14 16:18:28,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:18:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-14 16:18:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-14 16:18:28,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:28,318 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:28,318 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:28,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1250708406, now seen corresponding path program 19 times [2018-10-14 16:18:28,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:29,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:29,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:18:29,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:18:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:18:29,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:18:29,443 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 23 states. [2018-10-14 16:18:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:29,990 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-14 16:18:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 16:18:29,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 196 [2018-10-14 16:18:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:29,992 INFO L225 Difference]: With dead ends: 202 [2018-10-14 16:18:29,992 INFO L226 Difference]: Without dead ends: 202 [2018-10-14 16:18:29,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:18:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-14 16:18:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-10-14 16:18:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-14 16:18:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-14 16:18:29,997 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-10-14 16:18:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:29,997 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-14 16:18:29,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:18:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-14 16:18:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-14 16:18:29,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:29,999 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,999 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:29,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash -718032660, now seen corresponding path program 20 times [2018-10-14 16:18:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:31,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:31,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:18:31,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:18:31,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:18:31,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:18:31,405 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 24 states. [2018-10-14 16:18:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:31,898 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-14 16:18:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:18:31,899 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 199 [2018-10-14 16:18:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:31,900 INFO L225 Difference]: With dead ends: 205 [2018-10-14 16:18:31,900 INFO L226 Difference]: Without dead ends: 205 [2018-10-14 16:18:31,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:18:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-14 16:18:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-10-14 16:18:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-14 16:18:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-14 16:18:31,905 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-10-14 16:18:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:31,905 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-14 16:18:31,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:18:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-14 16:18:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-14 16:18:31,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:31,907 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:31,907 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:31,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1679042294, now seen corresponding path program 21 times [2018-10-14 16:18:31,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 16:18:33,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 16:18:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 16:18:33,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-14 16:18:33,211 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 25 states. [2018-10-14 16:18:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:33,697 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-14 16:18:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 16:18:33,698 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 202 [2018-10-14 16:18:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:33,699 INFO L225 Difference]: With dead ends: 208 [2018-10-14 16:18:33,699 INFO L226 Difference]: Without dead ends: 208 [2018-10-14 16:18:33,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:18:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-14 16:18:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-10-14 16:18:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-14 16:18:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-14 16:18:33,704 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-10-14 16:18:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:33,704 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-14 16:18:33,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 16:18:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-14 16:18:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-14 16:18:33,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:33,706 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:33,706 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:33,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash -865053652, now seen corresponding path program 22 times [2018-10-14 16:18:33,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:34,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:18:34,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:18:34,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:18:34,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:18:34,905 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 26 states. [2018-10-14 16:18:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:35,482 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-14 16:18:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 16:18:35,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 205 [2018-10-14 16:18:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:35,484 INFO L225 Difference]: With dead ends: 211 [2018-10-14 16:18:35,484 INFO L226 Difference]: Without dead ends: 211 [2018-10-14 16:18:35,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:18:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-14 16:18:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-14 16:18:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-14 16:18:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-14 16:18:35,488 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-10-14 16:18:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:35,489 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-14 16:18:35,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:18:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-14 16:18:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-14 16:18:35,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:35,490 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:35,490 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:35,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash -714773046, now seen corresponding path program 23 times [2018-10-14 16:18:35,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:35,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:35,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:18:35,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:18:35,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:18:35,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:18:35,950 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 27 states. [2018-10-14 16:18:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:36,533 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-14 16:18:36,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 16:18:36,533 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 208 [2018-10-14 16:18:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:36,534 INFO L225 Difference]: With dead ends: 214 [2018-10-14 16:18:36,534 INFO L226 Difference]: Without dead ends: 214 [2018-10-14 16:18:36,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:18:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-14 16:18:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-14 16:18:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-14 16:18:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-14 16:18:36,539 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-10-14 16:18:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:36,539 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-14 16:18:36,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:18:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-14 16:18:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-14 16:18:36,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:36,540 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:36,540 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:36,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 938837868, now seen corresponding path program 24 times [2018-10-14 16:18:36,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:37,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:18:37,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:18:37,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:18:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:18:37,214 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 28 states. [2018-10-14 16:18:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:37,775 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-14 16:18:37,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 16:18:37,776 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 211 [2018-10-14 16:18:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:37,777 INFO L225 Difference]: With dead ends: 217 [2018-10-14 16:18:37,777 INFO L226 Difference]: Without dead ends: 217 [2018-10-14 16:18:37,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:18:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-14 16:18:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-14 16:18:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-14 16:18:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-14 16:18:37,782 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-10-14 16:18:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:37,783 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-14 16:18:37,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:18:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-14 16:18:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-14 16:18:37,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:37,785 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,785 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:37,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 386691722, now seen corresponding path program 25 times [2018-10-14 16:18:37,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:38,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:38,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:18:38,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:18:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:18:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:18:38,861 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 29 states. [2018-10-14 16:18:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:39,805 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-14 16:18:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 16:18:39,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 214 [2018-10-14 16:18:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:39,812 INFO L225 Difference]: With dead ends: 220 [2018-10-14 16:18:39,812 INFO L226 Difference]: Without dead ends: 220 [2018-10-14 16:18:39,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:18:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-14 16:18:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-10-14 16:18:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 16:18:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-14 16:18:39,816 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-10-14 16:18:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:39,817 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-14 16:18:39,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:18:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-14 16:18:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-14 16:18:39,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:39,818 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:39,819 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:39,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1125599916, now seen corresponding path program 26 times [2018-10-14 16:18:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:40,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:40,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:18:40,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:18:40,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:18:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:18:40,538 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 30 states. [2018-10-14 16:18:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:41,187 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-14 16:18:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:18:41,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 217 [2018-10-14 16:18:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:41,189 INFO L225 Difference]: With dead ends: 223 [2018-10-14 16:18:41,189 INFO L226 Difference]: Without dead ends: 223 [2018-10-14 16:18:41,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:18:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-14 16:18:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-14 16:18:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-14 16:18:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-14 16:18:41,193 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-10-14 16:18:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:41,193 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-14 16:18:41,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:18:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-14 16:18:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-14 16:18:41,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:41,195 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:41,195 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:41,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2062751926, now seen corresponding path program 27 times [2018-10-14 16:18:41,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:41,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:41,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:18:41,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:18:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:18:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:18:41,789 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 31 states. [2018-10-14 16:18:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:42,526 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-14 16:18:42,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 16:18:42,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 220 [2018-10-14 16:18:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:42,528 INFO L225 Difference]: With dead ends: 226 [2018-10-14 16:18:42,528 INFO L226 Difference]: Without dead ends: 226 [2018-10-14 16:18:42,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:18:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-14 16:18:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-14 16:18:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-14 16:18:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-14 16:18:42,533 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-10-14 16:18:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:42,533 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-14 16:18:42,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:18:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-14 16:18:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-14 16:18:42,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:42,535 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:42,535 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:42,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1244241388, now seen corresponding path program 28 times [2018-10-14 16:18:42,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:43,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:18:43,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:18:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:18:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:18:43,478 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 32 states. [2018-10-14 16:18:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:44,430 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-14 16:18:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 16:18:44,431 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 223 [2018-10-14 16:18:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:44,432 INFO L225 Difference]: With dead ends: 229 [2018-10-14 16:18:44,432 INFO L226 Difference]: Without dead ends: 229 [2018-10-14 16:18:44,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:18:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-14 16:18:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-14 16:18:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 16:18:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-14 16:18:44,437 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-10-14 16:18:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:44,437 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-14 16:18:44,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:18:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-14 16:18:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 16:18:44,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:44,438 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:44,439 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:44,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1922223114, now seen corresponding path program 29 times [2018-10-14 16:18:44,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:45,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:45,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:18:45,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:18:45,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:18:45,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:18:45,361 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 33 states. [2018-10-14 16:18:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:46,158 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-14 16:18:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 16:18:46,158 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 226 [2018-10-14 16:18:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:46,159 INFO L225 Difference]: With dead ends: 232 [2018-10-14 16:18:46,160 INFO L226 Difference]: Without dead ends: 232 [2018-10-14 16:18:46,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:18:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-14 16:18:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-14 16:18:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-14 16:18:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-14 16:18:46,164 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-10-14 16:18:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:46,164 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-14 16:18:46,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:18:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-14 16:18:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-14 16:18:46,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:46,166 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,166 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:46,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash 444629292, now seen corresponding path program 30 times [2018-10-14 16:18:46,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:18:46,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:18:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:18:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:18:46,803 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 34 states. [2018-10-14 16:18:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:47,701 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-14 16:18:47,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:18:47,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2018-10-14 16:18:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:47,702 INFO L225 Difference]: With dead ends: 235 [2018-10-14 16:18:47,702 INFO L226 Difference]: Without dead ends: 235 [2018-10-14 16:18:47,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:18:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-14 16:18:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-14 16:18:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-14 16:18:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-14 16:18:47,707 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-10-14 16:18:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:47,707 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-14 16:18:47,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:18:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-14 16:18:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-14 16:18:47,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:47,708 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,709 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:47,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash 566894794, now seen corresponding path program 31 times [2018-10-14 16:18:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:48,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:48,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:18:48,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:18:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:18:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:18:48,415 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 35 states. [2018-10-14 16:18:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:49,382 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-14 16:18:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 16:18:49,382 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 232 [2018-10-14 16:18:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:49,383 INFO L225 Difference]: With dead ends: 238 [2018-10-14 16:18:49,383 INFO L226 Difference]: Without dead ends: 238 [2018-10-14 16:18:49,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:18:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-14 16:18:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-10-14 16:18:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-14 16:18:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-14 16:18:49,388 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-10-14 16:18:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:49,388 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-14 16:18:49,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:18:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-14 16:18:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-14 16:18:49,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:49,389 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,389 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:49,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash 846197868, now seen corresponding path program 32 times [2018-10-14 16:18:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:50,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:50,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:18:50,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:18:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:18:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:18:50,472 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 36 states. [2018-10-14 16:18:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:51,559 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-14 16:18:51,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:18:51,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 235 [2018-10-14 16:18:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:51,562 INFO L225 Difference]: With dead ends: 241 [2018-10-14 16:18:51,562 INFO L226 Difference]: Without dead ends: 241 [2018-10-14 16:18:51,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:18:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-14 16:18:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-14 16:18:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-14 16:18:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-14 16:18:51,568 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-10-14 16:18:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:51,569 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-14 16:18:51,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:18:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-14 16:18:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-14 16:18:51,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:51,572 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:51,572 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:51,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2082544246, now seen corresponding path program 33 times [2018-10-14 16:18:51,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:52,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:52,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:18:52,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:18:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:18:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:18:52,643 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 37 states. [2018-10-14 16:18:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:53,745 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-14 16:18:53,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 16:18:53,746 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 238 [2018-10-14 16:18:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:53,747 INFO L225 Difference]: With dead ends: 244 [2018-10-14 16:18:53,747 INFO L226 Difference]: Without dead ends: 244 [2018-10-14 16:18:53,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 16:18:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-14 16:18:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-10-14 16:18:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-14 16:18:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-14 16:18:53,750 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-10-14 16:18:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:53,751 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-14 16:18:53,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:18:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-14 16:18:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-14 16:18:53,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:53,752 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:53,752 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:53,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 21755820, now seen corresponding path program 34 times [2018-10-14 16:18:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:55,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:18:55,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:18:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:18:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:18:55,302 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 38 states. [2018-10-14 16:18:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:56,436 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-14 16:18:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:18:56,437 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 241 [2018-10-14 16:18:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:56,438 INFO L225 Difference]: With dead ends: 247 [2018-10-14 16:18:56,438 INFO L226 Difference]: Without dead ends: 247 [2018-10-14 16:18:56,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:18:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-14 16:18:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-14 16:18:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-14 16:18:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-14 16:18:56,442 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-10-14 16:18:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:56,442 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-14 16:18:56,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:18:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-14 16:18:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-14 16:18:56,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:56,444 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:56,444 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:56,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash -117630390, now seen corresponding path program 35 times [2018-10-14 16:18:56,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:18:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:18:57,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:18:57,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:18:57,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:18:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:18:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:18:57,704 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 39 states. [2018-10-14 16:18:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:18:59,419 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-14 16:18:59,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 16:18:59,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 244 [2018-10-14 16:18:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:18:59,421 INFO L225 Difference]: With dead ends: 250 [2018-10-14 16:18:59,421 INFO L226 Difference]: Without dead ends: 250 [2018-10-14 16:18:59,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:18:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-14 16:18:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-14 16:18:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-14 16:18:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-14 16:18:59,425 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-10-14 16:18:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:18:59,425 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-14 16:18:59,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:18:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-14 16:18:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-14 16:18:59,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:18:59,426 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:59,426 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:18:59,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:18:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 661162732, now seen corresponding path program 36 times [2018-10-14 16:18:59,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:18:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:00,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:00,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:19:00,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:19:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:19:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:19:00,434 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 40 states. [2018-10-14 16:19:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:01,626 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-14 16:19:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 16:19:01,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 247 [2018-10-14 16:19:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:01,627 INFO L225 Difference]: With dead ends: 253 [2018-10-14 16:19:01,627 INFO L226 Difference]: Without dead ends: 253 [2018-10-14 16:19:01,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 16:19:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-14 16:19:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-10-14 16:19:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-14 16:19:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-14 16:19:01,631 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-10-14 16:19:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:01,631 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-14 16:19:01,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:19:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-14 16:19:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-14 16:19:01,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:01,633 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:01,633 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:01,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash 273727242, now seen corresponding path program 37 times [2018-10-14 16:19:01,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:02,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:02,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 16:19:02,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 16:19:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 16:19:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 16:19:02,478 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 41 states. [2018-10-14 16:19:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:03,677 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-14 16:19:03,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 16:19:03,677 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 250 [2018-10-14 16:19:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:03,678 INFO L225 Difference]: With dead ends: 256 [2018-10-14 16:19:03,678 INFO L226 Difference]: Without dead ends: 256 [2018-10-14 16:19:03,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:19:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-14 16:19:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-10-14 16:19:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-14 16:19:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-14 16:19:03,682 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-10-14 16:19:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:03,683 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-14 16:19:03,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 16:19:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-14 16:19:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-14 16:19:03,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:03,684 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:03,685 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:03,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1239830996, now seen corresponding path program 38 times [2018-10-14 16:19:03,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:04,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:04,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:19:04,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:19:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:19:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:19:04,623 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 42 states. [2018-10-14 16:19:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:05,969 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-14 16:19:05,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:19:05,970 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 253 [2018-10-14 16:19:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:05,970 INFO L225 Difference]: With dead ends: 259 [2018-10-14 16:19:05,971 INFO L226 Difference]: Without dead ends: 259 [2018-10-14 16:19:05,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 16:19:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-14 16:19:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-14 16:19:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-14 16:19:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-14 16:19:05,975 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-10-14 16:19:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:05,975 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-14 16:19:05,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:19:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-14 16:19:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-14 16:19:05,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:05,977 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:05,977 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:05,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1208341450, now seen corresponding path program 39 times [2018-10-14 16:19:05,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:06,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:06,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:19:06,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:19:06,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:19:06,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:19:06,903 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 43 states. [2018-10-14 16:19:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:08,230 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-14 16:19:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 16:19:08,236 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 256 [2018-10-14 16:19:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:08,237 INFO L225 Difference]: With dead ends: 262 [2018-10-14 16:19:08,237 INFO L226 Difference]: Without dead ends: 262 [2018-10-14 16:19:08,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 16:19:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-14 16:19:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-14 16:19:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-14 16:19:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-14 16:19:08,242 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-10-14 16:19:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:08,242 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-14 16:19:08,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:19:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-14 16:19:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-14 16:19:08,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:08,244 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:08,244 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:08,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1874026860, now seen corresponding path program 40 times [2018-10-14 16:19:08,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:09,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:19:09,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:19:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:19:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:19:09,205 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 44 states. [2018-10-14 16:19:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:10,735 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-14 16:19:10,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 16:19:10,736 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 259 [2018-10-14 16:19:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:10,737 INFO L225 Difference]: With dead ends: 265 [2018-10-14 16:19:10,737 INFO L226 Difference]: Without dead ends: 265 [2018-10-14 16:19:10,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:19:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-14 16:19:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-10-14 16:19:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-14 16:19:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-14 16:19:10,740 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-10-14 16:19:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:10,740 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-14 16:19:10,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:19:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-14 16:19:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-14 16:19:10,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:10,741 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:10,742 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:10,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash -850896758, now seen corresponding path program 41 times [2018-10-14 16:19:10,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:11,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:11,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 16:19:11,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 16:19:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 16:19:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 16:19:11,941 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 45 states. [2018-10-14 16:19:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:13,521 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-14 16:19:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:19:13,521 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 262 [2018-10-14 16:19:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:13,522 INFO L225 Difference]: With dead ends: 268 [2018-10-14 16:19:13,522 INFO L226 Difference]: Without dead ends: 268 [2018-10-14 16:19:13,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 16:19:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-14 16:19:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-14 16:19:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-14 16:19:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-14 16:19:13,526 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-10-14 16:19:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:13,527 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-14 16:19:13,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 16:19:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-14 16:19:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-14 16:19:13,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:13,528 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:13,529 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:13,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash 126461100, now seen corresponding path program 42 times [2018-10-14 16:19:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:14,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:14,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:19:14,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:19:14,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:19:14,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:19:14,592 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 46 states. [2018-10-14 16:19:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:16,268 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-14 16:19:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:19:16,268 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 265 [2018-10-14 16:19:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:16,269 INFO L225 Difference]: With dead ends: 271 [2018-10-14 16:19:16,269 INFO L226 Difference]: Without dead ends: 271 [2018-10-14 16:19:16,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 16:19:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-14 16:19:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-14 16:19:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-14 16:19:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-14 16:19:16,275 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-10-14 16:19:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:16,275 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-14 16:19:16,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:19:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-14 16:19:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-14 16:19:16,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:16,277 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:16,277 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:16,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1011109194, now seen corresponding path program 43 times [2018-10-14 16:19:16,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:17,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:17,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:19:17,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:19:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:19:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:19:17,407 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 47 states. [2018-10-14 16:19:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:18,878 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-14 16:19:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 16:19:18,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 268 [2018-10-14 16:19:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:18,879 INFO L225 Difference]: With dead ends: 274 [2018-10-14 16:19:18,879 INFO L226 Difference]: Without dead ends: 274 [2018-10-14 16:19:18,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 16:19:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-14 16:19:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-10-14 16:19:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-14 16:19:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-14 16:19:18,883 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-10-14 16:19:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:18,883 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-14 16:19:18,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:19:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-14 16:19:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-14 16:19:18,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:18,885 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:18,885 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:18,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1643149292, now seen corresponding path program 44 times [2018-10-14 16:19:18,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:20,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:20,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:19:20,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:19:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:19:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:19:20,038 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 48 states. [2018-10-14 16:19:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:21,873 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-14 16:19:21,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 16:19:21,873 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 271 [2018-10-14 16:19:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:21,874 INFO L225 Difference]: With dead ends: 277 [2018-10-14 16:19:21,874 INFO L226 Difference]: Without dead ends: 277 [2018-10-14 16:19:21,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 16:19:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-14 16:19:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-14 16:19:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-14 16:19:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-14 16:19:21,878 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-10-14 16:19:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:21,879 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-14 16:19:21,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:19:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-14 16:19:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-14 16:19:21,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:21,880 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:21,881 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:21,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1613083146, now seen corresponding path program 45 times [2018-10-14 16:19:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:23,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:23,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 16:19:23,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 16:19:23,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 16:19:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:19:23,101 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 49 states. [2018-10-14 16:19:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:24,761 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-14 16:19:24,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 16:19:24,761 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 274 [2018-10-14 16:19:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:24,762 INFO L225 Difference]: With dead ends: 280 [2018-10-14 16:19:24,762 INFO L226 Difference]: Without dead ends: 280 [2018-10-14 16:19:24,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 16:19:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-14 16:19:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-10-14 16:19:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-14 16:19:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-14 16:19:24,766 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-10-14 16:19:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:24,766 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-14 16:19:24,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 16:19:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-14 16:19:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-14 16:19:24,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:24,768 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:24,768 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:24,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -734274772, now seen corresponding path program 46 times [2018-10-14 16:19:24,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:19:26,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:19:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:19:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:19:26,218 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 50 states. [2018-10-14 16:19:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:27,861 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-14 16:19:27,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 16:19:27,862 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 277 [2018-10-14 16:19:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:27,863 INFO L225 Difference]: With dead ends: 283 [2018-10-14 16:19:27,863 INFO L226 Difference]: Without dead ends: 283 [2018-10-14 16:19:27,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 16:19:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-14 16:19:27,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-10-14 16:19:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-14 16:19:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-14 16:19:27,867 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-10-14 16:19:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:27,867 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-14 16:19:27,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:19:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-14 16:19:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-14 16:19:27,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:27,869 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,869 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:27,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash -216496438, now seen corresponding path program 47 times [2018-10-14 16:19:27,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:29,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:29,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:19:29,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:19:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:19:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:19:29,054 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 51 states. [2018-10-14 16:19:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:31,244 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-14 16:19:31,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 16:19:31,245 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 280 [2018-10-14 16:19:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:31,246 INFO L225 Difference]: With dead ends: 286 [2018-10-14 16:19:31,246 INFO L226 Difference]: Without dead ends: 286 [2018-10-14 16:19:31,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 16:19:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-14 16:19:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-14 16:19:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-14 16:19:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-14 16:19:31,250 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-10-14 16:19:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:31,250 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-14 16:19:31,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:19:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-14 16:19:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-14 16:19:31,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:31,251 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:31,251 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:31,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1690291820, now seen corresponding path program 48 times [2018-10-14 16:19:31,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:32,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:32,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:19:32,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:19:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:19:32,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:19:32,499 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 52 states. [2018-10-14 16:19:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:34,352 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-14 16:19:34,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:19:34,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 283 [2018-10-14 16:19:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:34,354 INFO L225 Difference]: With dead ends: 289 [2018-10-14 16:19:34,354 INFO L226 Difference]: Without dead ends: 289 [2018-10-14 16:19:34,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-14 16:19:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-14 16:19:34,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-14 16:19:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-14 16:19:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-14 16:19:34,358 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-10-14 16:19:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:34,358 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-14 16:19:34,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:19:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-14 16:19:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-14 16:19:34,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:34,360 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:34,360 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:34,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:34,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1581829002, now seen corresponding path program 49 times [2018-10-14 16:19:34,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:36,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:36,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 16:19:36,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 16:19:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 16:19:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:19:36,117 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 53 states. [2018-10-14 16:19:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:37,843 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-14 16:19:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 16:19:37,843 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 286 [2018-10-14 16:19:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:37,844 INFO L225 Difference]: With dead ends: 292 [2018-10-14 16:19:37,844 INFO L226 Difference]: Without dead ends: 292 [2018-10-14 16:19:37,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 16:19:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-14 16:19:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-10-14 16:19:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-14 16:19:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-14 16:19:37,849 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-10-14 16:19:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:37,849 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-14 16:19:37,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 16:19:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-14 16:19:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-14 16:19:37,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:37,851 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:37,851 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:37,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash 181424556, now seen corresponding path program 50 times [2018-10-14 16:19:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:39,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:39,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:19:39,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:19:39,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:19:39,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:19:39,223 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 54 states. [2018-10-14 16:19:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:41,389 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-14 16:19:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 16:19:41,389 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 289 [2018-10-14 16:19:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:41,391 INFO L225 Difference]: With dead ends: 295 [2018-10-14 16:19:41,391 INFO L226 Difference]: Without dead ends: 295 [2018-10-14 16:19:41,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 16:19:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-14 16:19:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-10-14 16:19:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-14 16:19:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-14 16:19:41,394 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-10-14 16:19:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:41,394 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-14 16:19:41,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:19:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-14 16:19:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-14 16:19:41,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:41,396 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:41,396 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:41,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2044887114, now seen corresponding path program 51 times [2018-10-14 16:19:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:42,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:42,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 16:19:42,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 16:19:42,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 16:19:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 16:19:42,895 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 55 states. [2018-10-14 16:19:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:44,946 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-14 16:19:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 16:19:44,947 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 292 [2018-10-14 16:19:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:44,948 INFO L225 Difference]: With dead ends: 298 [2018-10-14 16:19:44,948 INFO L226 Difference]: Without dead ends: 298 [2018-10-14 16:19:44,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-14 16:19:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-14 16:19:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-10-14 16:19:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-14 16:19:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-14 16:19:44,952 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-10-14 16:19:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:44,952 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-14 16:19:44,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 16:19:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-14 16:19:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-14 16:19:44,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:44,953 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,954 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:44,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash -289315604, now seen corresponding path program 52 times [2018-10-14 16:19:44,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:46,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:46,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 16:19:46,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 16:19:46,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 16:19:46,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:19:46,638 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 56 states. [2018-10-14 16:19:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:48,753 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-14 16:19:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 16:19:48,753 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 295 [2018-10-14 16:19:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:48,755 INFO L225 Difference]: With dead ends: 301 [2018-10-14 16:19:48,755 INFO L226 Difference]: Without dead ends: 301 [2018-10-14 16:19:48,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 16:19:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-14 16:19:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-14 16:19:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-14 16:19:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-14 16:19:48,759 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-10-14 16:19:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:48,759 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-14 16:19:48,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 16:19:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-14 16:19:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-14 16:19:48,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:48,761 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,761 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:48,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1293001994, now seen corresponding path program 53 times [2018-10-14 16:19:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:50,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:50,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 16:19:50,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 16:19:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 16:19:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 16:19:50,317 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 57 states. [2018-10-14 16:19:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:52,717 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-14 16:19:52,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 16:19:52,717 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 298 [2018-10-14 16:19:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:52,718 INFO L225 Difference]: With dead ends: 304 [2018-10-14 16:19:52,719 INFO L226 Difference]: Without dead ends: 304 [2018-10-14 16:19:52,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-14 16:19:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-14 16:19:52,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-14 16:19:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-14 16:19:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-14 16:19:52,723 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-10-14 16:19:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:52,723 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-14 16:19:52,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 16:19:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-14 16:19:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-14 16:19:52,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:52,725 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,725 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:52,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1444476884, now seen corresponding path program 54 times [2018-10-14 16:19:52,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:54,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:54,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 16:19:54,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 16:19:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 16:19:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:19:54,252 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 58 states. [2018-10-14 16:19:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:19:56,709 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-14 16:19:56,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 16:19:56,710 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 301 [2018-10-14 16:19:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:19:56,711 INFO L225 Difference]: With dead ends: 307 [2018-10-14 16:19:56,711 INFO L226 Difference]: Without dead ends: 307 [2018-10-14 16:19:56,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 16:19:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-14 16:19:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-14 16:19:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-14 16:19:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-14 16:19:56,714 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-10-14 16:19:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:19:56,715 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-14 16:19:56,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 16:19:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-14 16:19:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-14 16:19:56,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:19:56,716 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:56,716 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:19:56,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:19:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash -838714934, now seen corresponding path program 55 times [2018-10-14 16:19:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:19:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:19:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:19:58,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:19:58,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 16:19:58,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 16:19:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 16:19:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 16:19:58,239 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 59 states. [2018-10-14 16:20:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:00,549 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-14 16:20:00,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 16:20:00,550 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 304 [2018-10-14 16:20:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:00,551 INFO L225 Difference]: With dead ends: 310 [2018-10-14 16:20:00,551 INFO L226 Difference]: Without dead ends: 310 [2018-10-14 16:20:00,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 16:20:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-14 16:20:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-14 16:20:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-14 16:20:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-14 16:20:00,554 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 304 [2018-10-14 16:20:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:00,555 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-14 16:20:00,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 16:20:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-14 16:20:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-14 16:20:00,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:00,556 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:00,556 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:00,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:00,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2037040276, now seen corresponding path program 56 times [2018-10-14 16:20:00,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:02,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:02,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:20:02,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:20:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:20:02,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:20:02,412 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 60 states. [2018-10-14 16:20:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:05,001 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-14 16:20:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 16:20:05,001 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 307 [2018-10-14 16:20:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:05,002 INFO L225 Difference]: With dead ends: 313 [2018-10-14 16:20:05,002 INFO L226 Difference]: Without dead ends: 313 [2018-10-14 16:20:05,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-14 16:20:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-14 16:20:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-14 16:20:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-14 16:20:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-14 16:20:05,005 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 307 [2018-10-14 16:20:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:05,006 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-14 16:20:05,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:20:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-14 16:20:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 16:20:05,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:05,007 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,008 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:05,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1579139446, now seen corresponding path program 57 times [2018-10-14 16:20:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:06,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:06,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 16:20:06,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 16:20:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 16:20:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 16:20:06,894 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 61 states. [2018-10-14 16:20:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:09,382 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-14 16:20:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 16:20:09,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 310 [2018-10-14 16:20:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:09,383 INFO L225 Difference]: With dead ends: 316 [2018-10-14 16:20:09,384 INFO L226 Difference]: Without dead ends: 316 [2018-10-14 16:20:09,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 16:20:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-14 16:20:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-10-14 16:20:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-14 16:20:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-14 16:20:09,387 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 310 [2018-10-14 16:20:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:09,387 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-14 16:20:09,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 16:20:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-14 16:20:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-14 16:20:09,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:09,388 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,389 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1071645012, now seen corresponding path program 58 times [2018-10-14 16:20:09,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:11,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:11,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:20:11,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:20:11,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:20:11,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:20:11,092 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 62 states. [2018-10-14 16:20:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:13,901 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-14 16:20:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 16:20:13,901 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 313 [2018-10-14 16:20:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:13,902 INFO L225 Difference]: With dead ends: 319 [2018-10-14 16:20:13,903 INFO L226 Difference]: Without dead ends: 319 [2018-10-14 16:20:13,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 16:20:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-14 16:20:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-14 16:20:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-14 16:20:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-14 16:20:13,906 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 313 [2018-10-14 16:20:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:13,906 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-14 16:20:13,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:20:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-14 16:20:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-14 16:20:13,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:13,908 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:13,908 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:13,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash -589843638, now seen corresponding path program 59 times [2018-10-14 16:20:13,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:15,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:15,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 16:20:15,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 16:20:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 16:20:15,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 16:20:15,681 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 63 states. [2018-10-14 16:20:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:18,594 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-14 16:20:18,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 16:20:18,594 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 316 [2018-10-14 16:20:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:18,595 INFO L225 Difference]: With dead ends: 322 [2018-10-14 16:20:18,596 INFO L226 Difference]: Without dead ends: 322 [2018-10-14 16:20:18,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 16:20:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-14 16:20:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-14 16:20:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-14 16:20:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-14 16:20:18,599 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 316 [2018-10-14 16:20:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:18,599 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-14 16:20:18,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 16:20:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-14 16:20:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-14 16:20:18,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:18,601 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:18,601 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:18,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1025814036, now seen corresponding path program 60 times [2018-10-14 16:20:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:20,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:20,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:20:20,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:20:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:20:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:20:20,419 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 64 states. [2018-10-14 16:20:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:23,324 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-14 16:20:23,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 16:20:23,325 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 319 [2018-10-14 16:20:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:23,326 INFO L225 Difference]: With dead ends: 325 [2018-10-14 16:20:23,326 INFO L226 Difference]: Without dead ends: 325 [2018-10-14 16:20:23,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 16:20:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-14 16:20:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2018-10-14 16:20:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-14 16:20:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-14 16:20:23,330 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 319 [2018-10-14 16:20:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:23,331 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-14 16:20:23,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:20:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-14 16:20:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-14 16:20:23,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:23,332 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:23,333 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1038837750, now seen corresponding path program 61 times [2018-10-14 16:20:23,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 16:20:25,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 16:20:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 16:20:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 16:20:25,240 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 65 states. [2018-10-14 16:20:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:28,234 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-14 16:20:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-14 16:20:28,235 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 322 [2018-10-14 16:20:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:28,236 INFO L225 Difference]: With dead ends: 328 [2018-10-14 16:20:28,236 INFO L226 Difference]: Without dead ends: 328 [2018-10-14 16:20:28,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-14 16:20:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-14 16:20:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-14 16:20:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-14 16:20:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-14 16:20:28,240 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 322 [2018-10-14 16:20:28,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:28,240 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-14 16:20:28,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 16:20:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-14 16:20:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-14 16:20:28,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:28,242 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,242 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:28,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1813722412, now seen corresponding path program 62 times [2018-10-14 16:20:28,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:30,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:30,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:20:30,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:20:30,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:20:30,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:20:30,212 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 66 states. [2018-10-14 16:20:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:33,103 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-14 16:20:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:20:33,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 325 [2018-10-14 16:20:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:33,105 INFO L225 Difference]: With dead ends: 331 [2018-10-14 16:20:33,105 INFO L226 Difference]: Without dead ends: 331 [2018-10-14 16:20:33,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-14 16:20:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-14 16:20:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-14 16:20:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-14 16:20:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-14 16:20:33,108 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 325 [2018-10-14 16:20:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:33,108 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-14 16:20:33,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 16:20:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-14 16:20:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-14 16:20:33,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:33,109 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,110 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:33,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2084377398, now seen corresponding path program 63 times [2018-10-14 16:20:33,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:35,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:35,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 16:20:35,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 16:20:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 16:20:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 16:20:35,097 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 67 states. [2018-10-14 16:20:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:38,268 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-10-14 16:20:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 16:20:38,268 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 328 [2018-10-14 16:20:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:38,270 INFO L225 Difference]: With dead ends: 334 [2018-10-14 16:20:38,270 INFO L226 Difference]: Without dead ends: 334 [2018-10-14 16:20:38,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-14 16:20:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-14 16:20:38,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-10-14 16:20:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-14 16:20:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-14 16:20:38,273 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 328 [2018-10-14 16:20:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:38,274 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-14 16:20:38,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 16:20:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-14 16:20:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-14 16:20:38,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:38,275 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,275 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:38,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1244899436, now seen corresponding path program 64 times [2018-10-14 16:20:38,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:40,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:40,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 16:20:40,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 16:20:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 16:20:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:20:40,295 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 68 states. [2018-10-14 16:20:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:43,566 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-14 16:20:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 16:20:43,566 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 331 [2018-10-14 16:20:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:43,567 INFO L225 Difference]: With dead ends: 337 [2018-10-14 16:20:43,568 INFO L226 Difference]: Without dead ends: 337 [2018-10-14 16:20:43,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 16:20:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-14 16:20:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-10-14 16:20:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-14 16:20:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-14 16:20:43,571 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 331 [2018-10-14 16:20:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:43,572 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-14 16:20:43,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 16:20:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-14 16:20:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-14 16:20:43,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:43,573 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,573 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:43,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash 51294602, now seen corresponding path program 65 times [2018-10-14 16:20:43,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:45,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:45,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 16:20:45,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 16:20:45,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 16:20:45,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 16:20:45,748 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 69 states. [2018-10-14 16:20:49,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:49,092 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-10-14 16:20:49,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 16:20:49,093 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 334 [2018-10-14 16:20:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:49,094 INFO L225 Difference]: With dead ends: 340 [2018-10-14 16:20:49,094 INFO L226 Difference]: Without dead ends: 340 [2018-10-14 16:20:49,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-14 16:20:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-14 16:20:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2018-10-14 16:20:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-14 16:20:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-10-14 16:20:49,098 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 334 [2018-10-14 16:20:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:49,098 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-10-14 16:20:49,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 16:20:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-10-14 16:20:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-14 16:20:49,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:49,099 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,100 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:49,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -596071508, now seen corresponding path program 66 times [2018-10-14 16:20:49,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:51,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:51,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 16:20:51,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 16:20:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 16:20:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 16:20:51,313 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 70 states. [2018-10-14 16:20:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:20:54,618 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-10-14 16:20:54,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:20:54,619 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 337 [2018-10-14 16:20:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:20:54,620 INFO L225 Difference]: With dead ends: 343 [2018-10-14 16:20:54,620 INFO L226 Difference]: Without dead ends: 343 [2018-10-14 16:20:54,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-14 16:20:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-14 16:20:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-14 16:20:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-14 16:20:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-10-14 16:20:54,623 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 337 [2018-10-14 16:20:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:20:54,624 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-10-14 16:20:54,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 16:20:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-10-14 16:20:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-14 16:20:54,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:20:54,625 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:54,625 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:20:54,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:20:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1876695478, now seen corresponding path program 67 times [2018-10-14 16:20:54,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:20:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:20:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:20:56,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:20:56,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 16:20:56,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 16:20:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 16:20:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 16:20:56,800 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 71 states. [2018-10-14 16:21:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:00,250 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-14 16:21:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-14 16:21:00,251 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 340 [2018-10-14 16:21:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:00,252 INFO L225 Difference]: With dead ends: 346 [2018-10-14 16:21:00,252 INFO L226 Difference]: Without dead ends: 346 [2018-10-14 16:21:00,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 16:21:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-14 16:21:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2018-10-14 16:21:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-14 16:21:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-14 16:21:00,256 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 340 [2018-10-14 16:21:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:00,256 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-14 16:21:00,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 16:21:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-14 16:21:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-14 16:21:00,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:00,257 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:00,257 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:00,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash -750895380, now seen corresponding path program 68 times [2018-10-14 16:21:00,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:02,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:02,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 16:21:02,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 16:21:02,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 16:21:02,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:21:02,537 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 72 states. [2018-10-14 16:21:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:05,912 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-10-14 16:21:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 16:21:05,912 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 343 [2018-10-14 16:21:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:05,913 INFO L225 Difference]: With dead ends: 349 [2018-10-14 16:21:05,914 INFO L226 Difference]: Without dead ends: 349 [2018-10-14 16:21:05,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-14 16:21:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-14 16:21:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2018-10-14 16:21:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-14 16:21:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-14 16:21:05,917 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 343 [2018-10-14 16:21:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:05,917 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-14 16:21:05,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 16:21:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-14 16:21:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-14 16:21:05,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:05,919 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:05,919 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:05,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1439790326, now seen corresponding path program 69 times [2018-10-14 16:21:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:08,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:08,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 16:21:08,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 16:21:08,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 16:21:08,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 16:21:08,472 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 73 states. [2018-10-14 16:21:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:11,841 INFO L93 Difference]: Finished difference Result 352 states and 352 transitions. [2018-10-14 16:21:11,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 16:21:11,842 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 346 [2018-10-14 16:21:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:11,843 INFO L225 Difference]: With dead ends: 352 [2018-10-14 16:21:11,843 INFO L226 Difference]: Without dead ends: 352 [2018-10-14 16:21:11,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-14 16:21:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-14 16:21:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2018-10-14 16:21:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-14 16:21:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-14 16:21:11,847 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 346 [2018-10-14 16:21:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:11,847 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-14 16:21:11,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 16:21:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-14 16:21:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-14 16:21:11,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:11,849 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:11,849 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:11,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1339580972, now seen corresponding path program 70 times [2018-10-14 16:21:11,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:14,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:14,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 16:21:14,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 16:21:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 16:21:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:21:14,468 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 74 states. [2018-10-14 16:21:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:17,868 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-14 16:21:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 16:21:17,868 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 349 [2018-10-14 16:21:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:17,870 INFO L225 Difference]: With dead ends: 355 [2018-10-14 16:21:17,870 INFO L226 Difference]: Without dead ends: 355 [2018-10-14 16:21:17,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-14 16:21:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-14 16:21:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2018-10-14 16:21:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-14 16:21:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-14 16:21:17,874 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 349 [2018-10-14 16:21:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:17,874 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-14 16:21:17,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 16:21:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-14 16:21:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-14 16:21:17,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:17,875 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:17,875 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:17,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1084579894, now seen corresponding path program 71 times [2018-10-14 16:21:17,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:20,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 16:21:20,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 16:21:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 16:21:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 16:21:20,876 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 75 states. [2018-10-14 16:21:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:24,802 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-14 16:21:24,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 16:21:24,803 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 352 [2018-10-14 16:21:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:24,804 INFO L225 Difference]: With dead ends: 358 [2018-10-14 16:21:24,804 INFO L226 Difference]: Without dead ends: 358 [2018-10-14 16:21:24,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 16:21:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-14 16:21:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-10-14 16:21:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-14 16:21:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-10-14 16:21:24,808 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 352 [2018-10-14 16:21:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:24,808 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-10-14 16:21:24,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 16:21:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-10-14 16:21:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-14 16:21:24,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:24,810 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:24,810 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:24,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash 614143340, now seen corresponding path program 72 times [2018-10-14 16:21:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:27,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:27,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 16:21:27,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 16:21:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 16:21:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 16:21:27,462 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 76 states. [2018-10-14 16:21:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:31,373 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-14 16:21:31,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 16:21:31,373 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 355 [2018-10-14 16:21:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:31,375 INFO L225 Difference]: With dead ends: 361 [2018-10-14 16:21:31,375 INFO L226 Difference]: Without dead ends: 361 [2018-10-14 16:21:31,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 16:21:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-14 16:21:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2018-10-14 16:21:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-14 16:21:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-14 16:21:31,378 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 355 [2018-10-14 16:21:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:31,379 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-14 16:21:31,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 16:21:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-14 16:21:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-14 16:21:31,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:31,380 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:31,380 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:31,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash -321641334, now seen corresponding path program 73 times [2018-10-14 16:21:31,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:34,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:34,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 16:21:34,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 16:21:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 16:21:34,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 16:21:34,190 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 77 states. [2018-10-14 16:21:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:37,716 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-10-14 16:21:37,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-14 16:21:37,716 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 358 [2018-10-14 16:21:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:37,717 INFO L225 Difference]: With dead ends: 364 [2018-10-14 16:21:37,717 INFO L226 Difference]: Without dead ends: 364 [2018-10-14 16:21:37,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 16:21:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-14 16:21:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-10-14 16:21:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-14 16:21:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-14 16:21:37,722 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 358 [2018-10-14 16:21:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:37,722 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-14 16:21:37,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 16:21:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-14 16:21:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-14 16:21:37,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:37,723 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:37,724 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:37,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash 349853868, now seen corresponding path program 74 times [2018-10-14 16:21:37,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:40,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:40,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 16:21:40,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 16:21:40,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 16:21:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:21:40,610 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 78 states. [2018-10-14 16:21:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:44,573 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-10-14 16:21:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 16:21:44,574 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 361 [2018-10-14 16:21:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:44,575 INFO L225 Difference]: With dead ends: 367 [2018-10-14 16:21:44,575 INFO L226 Difference]: Without dead ends: 367 [2018-10-14 16:21:44,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-14 16:21:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-14 16:21:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-10-14 16:21:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-14 16:21:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-10-14 16:21:44,578 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 361 [2018-10-14 16:21:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:44,579 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-10-14 16:21:44,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 16:21:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-10-14 16:21:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-14 16:21:44,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:44,580 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,580 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:44,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:44,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1094248118, now seen corresponding path program 75 times [2018-10-14 16:21:44,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:47,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:47,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 16:21:47,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 16:21:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 16:21:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 16:21:47,341 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 79 states. [2018-10-14 16:21:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:51,578 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-10-14 16:21:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 16:21:51,578 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 364 [2018-10-14 16:21:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:51,580 INFO L225 Difference]: With dead ends: 370 [2018-10-14 16:21:51,580 INFO L226 Difference]: Without dead ends: 370 [2018-10-14 16:21:51,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-14 16:21:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-14 16:21:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2018-10-14 16:21:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-14 16:21:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-10-14 16:21:51,584 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 364 [2018-10-14 16:21:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:51,584 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-10-14 16:21:51,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 16:21:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-10-14 16:21:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-14 16:21:51,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:51,585 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:51,585 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:51,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash 350890988, now seen corresponding path program 76 times [2018-10-14 16:21:51,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:21:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:21:54,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:21:54,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 16:21:54,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 16:21:54,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 16:21:54,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 16:21:54,569 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 80 states. [2018-10-14 16:21:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:21:58,616 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-14 16:21:58,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 16:21:58,616 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 367 [2018-10-14 16:21:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:21:58,617 INFO L225 Difference]: With dead ends: 373 [2018-10-14 16:21:58,618 INFO L226 Difference]: Without dead ends: 373 [2018-10-14 16:21:58,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 16:21:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-14 16:21:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2018-10-14 16:21:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-14 16:21:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-14 16:21:58,621 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 367 [2018-10-14 16:21:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:21:58,622 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-14 16:21:58,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 16:21:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-14 16:21:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-14 16:21:58,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:21:58,623 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:58,623 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:21:58,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:21:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash -262177270, now seen corresponding path program 77 times [2018-10-14 16:21:58,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:21:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:01,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:01,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 16:22:01,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 16:22:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 16:22:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 16:22:01,801 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 81 states. [2018-10-14 16:22:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:05,954 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2018-10-14 16:22:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 16:22:05,955 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 370 [2018-10-14 16:22:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:05,956 INFO L225 Difference]: With dead ends: 376 [2018-10-14 16:22:05,956 INFO L226 Difference]: Without dead ends: 376 [2018-10-14 16:22:05,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 16:22:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-14 16:22:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2018-10-14 16:22:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-14 16:22:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-10-14 16:22:05,960 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 370 [2018-10-14 16:22:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:05,960 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-10-14 16:22:05,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 16:22:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-10-14 16:22:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-14 16:22:05,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:05,962 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:05,962 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:05,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1977708756, now seen corresponding path program 78 times [2018-10-14 16:22:05,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:08,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:08,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 16:22:08,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 16:22:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 16:22:08,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 16:22:08,938 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 82 states. [2018-10-14 16:22:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:13,350 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-14 16:22:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 16:22:13,351 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 373 [2018-10-14 16:22:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:13,352 INFO L225 Difference]: With dead ends: 379 [2018-10-14 16:22:13,352 INFO L226 Difference]: Without dead ends: 379 [2018-10-14 16:22:13,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-14 16:22:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-14 16:22:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-10-14 16:22:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-14 16:22:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-10-14 16:22:13,356 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 373 [2018-10-14 16:22:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:13,356 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-10-14 16:22:13,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 16:22:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-10-14 16:22:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-14 16:22:13,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:13,358 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,358 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:13,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 734614218, now seen corresponding path program 79 times [2018-10-14 16:22:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:16,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:16,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 16:22:16,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 16:22:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 16:22:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 16:22:16,692 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 83 states. [2018-10-14 16:22:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:21,192 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2018-10-14 16:22:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-14 16:22:21,193 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 376 [2018-10-14 16:22:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:21,194 INFO L225 Difference]: With dead ends: 382 [2018-10-14 16:22:21,194 INFO L226 Difference]: Without dead ends: 382 [2018-10-14 16:22:21,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 16:22:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-14 16:22:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-10-14 16:22:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-14 16:22:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-14 16:22:21,198 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 376 [2018-10-14 16:22:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:21,198 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-14 16:22:21,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 16:22:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-14 16:22:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-14 16:22:21,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:21,199 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,200 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:21,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1966374292, now seen corresponding path program 80 times [2018-10-14 16:22:21,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:24,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 16:22:24,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 16:22:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 16:22:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:22:24,381 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 84 states. [2018-10-14 16:22:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:28,965 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-14 16:22:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 16:22:28,965 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 379 [2018-10-14 16:22:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:28,967 INFO L225 Difference]: With dead ends: 385 [2018-10-14 16:22:28,967 INFO L226 Difference]: Without dead ends: 385 [2018-10-14 16:22:28,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-14 16:22:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-14 16:22:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2018-10-14 16:22:28,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-14 16:22:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-10-14 16:22:28,971 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 379 [2018-10-14 16:22:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:28,971 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-10-14 16:22:28,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 16:22:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-10-14 16:22:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-14 16:22:28,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:28,972 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:28,973 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:28,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -902785142, now seen corresponding path program 81 times [2018-10-14 16:22:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:32,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 16:22:32,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 16:22:32,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 16:22:32,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 16:22:32,248 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 85 states. [2018-10-14 16:22:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:36,921 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-14 16:22:36,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 16:22:36,921 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 382 [2018-10-14 16:22:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:36,923 INFO L225 Difference]: With dead ends: 388 [2018-10-14 16:22:36,923 INFO L226 Difference]: Without dead ends: 388 [2018-10-14 16:22:36,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-14 16:22:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-14 16:22:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2018-10-14 16:22:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-14 16:22:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-10-14 16:22:36,927 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 382 [2018-10-14 16:22:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:36,927 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-10-14 16:22:36,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 16:22:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-10-14 16:22:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-14 16:22:36,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:36,929 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:36,929 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:36,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:36,929 INFO L82 PathProgramCache]: Analyzing trace with hash 507839916, now seen corresponding path program 82 times [2018-10-14 16:22:36,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:40,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:40,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 16:22:40,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 16:22:40,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 16:22:40,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 16:22:40,415 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 86 states. [2018-10-14 16:22:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:44,956 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-14 16:22:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 16:22:44,957 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 385 [2018-10-14 16:22:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:44,958 INFO L225 Difference]: With dead ends: 391 [2018-10-14 16:22:44,958 INFO L226 Difference]: Without dead ends: 391 [2018-10-14 16:22:44,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 16:22:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-14 16:22:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-10-14 16:22:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-14 16:22:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-14 16:22:44,963 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 385 [2018-10-14 16:22:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:44,963 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-14 16:22:44,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 16:22:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-14 16:22:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-14 16:22:44,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:44,965 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:44,965 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:44,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:44,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1816048566, now seen corresponding path program 83 times [2018-10-14 16:22:44,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:48,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:48,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 16:22:48,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 16:22:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 16:22:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 16:22:48,449 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 87 states. [2018-10-14 16:22:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:22:53,277 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2018-10-14 16:22:53,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 16:22:53,277 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 388 [2018-10-14 16:22:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:22:53,278 INFO L225 Difference]: With dead ends: 394 [2018-10-14 16:22:53,278 INFO L226 Difference]: Without dead ends: 394 [2018-10-14 16:22:53,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-14 16:22:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-14 16:22:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2018-10-14 16:22:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-14 16:22:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-10-14 16:22:53,283 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 388 [2018-10-14 16:22:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:22:53,283 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-10-14 16:22:53,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 16:22:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-10-14 16:22:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-14 16:22:53,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:22:53,285 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:53,285 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:22:53,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:22:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2094995692, now seen corresponding path program 84 times [2018-10-14 16:22:53,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:22:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:22:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:22:56,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:22:56,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 16:22:56,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 16:22:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 16:22:56,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 16:22:56,857 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 88 states. [2018-10-14 16:23:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:01,854 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-10-14 16:23:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 16:23:01,854 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 391 [2018-10-14 16:23:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:01,856 INFO L225 Difference]: With dead ends: 397 [2018-10-14 16:23:01,856 INFO L226 Difference]: Without dead ends: 397 [2018-10-14 16:23:01,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-14 16:23:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-14 16:23:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2018-10-14 16:23:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-14 16:23:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-14 16:23:01,860 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 391 [2018-10-14 16:23:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:01,861 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-14 16:23:01,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-14 16:23:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-14 16:23:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-14 16:23:01,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:01,863 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:01,863 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2141679882, now seen corresponding path program 85 times [2018-10-14 16:23:01,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:23:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:23:05,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:23:05,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 16:23:05,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 16:23:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 16:23:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 16:23:05,330 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 89 states. [2018-10-14 16:23:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:10,473 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-10-14 16:23:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-14 16:23:10,473 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 394 [2018-10-14 16:23:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:10,475 INFO L225 Difference]: With dead ends: 400 [2018-10-14 16:23:10,475 INFO L226 Difference]: Without dead ends: 400 [2018-10-14 16:23:10,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-14 16:23:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-14 16:23:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2018-10-14 16:23:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-14 16:23:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-10-14 16:23:10,480 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 394 [2018-10-14 16:23:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:10,481 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-10-14 16:23:10,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 16:23:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-10-14 16:23:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-14 16:23:10,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:10,483 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:10,483 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:10,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1340980268, now seen corresponding path program 86 times [2018-10-14 16:23:10,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:23:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:23:14,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:23:14,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-14 16:23:14,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-14 16:23:14,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-14 16:23:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 16:23:14,280 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 90 states. [2018-10-14 16:23:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:19,296 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-10-14 16:23:19,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 16:23:19,297 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 397 [2018-10-14 16:23:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:19,298 INFO L225 Difference]: With dead ends: 403 [2018-10-14 16:23:19,298 INFO L226 Difference]: Without dead ends: 403 [2018-10-14 16:23:19,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-14 16:23:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-14 16:23:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2018-10-14 16:23:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-14 16:23:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-10-14 16:23:19,302 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 397 [2018-10-14 16:23:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:19,303 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-10-14 16:23:19,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-14 16:23:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-10-14 16:23:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-14 16:23:19,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:19,304 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:19,304 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:19,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1947141578, now seen corresponding path program 87 times [2018-10-14 16:23:19,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:23:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:23:23,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:23:23,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 16:23:23,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 16:23:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 16:23:23,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 16:23:23,108 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 91 states. [2018-10-14 16:23:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:28,328 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2018-10-14 16:23:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 16:23:28,329 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 400 [2018-10-14 16:23:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:28,330 INFO L225 Difference]: With dead ends: 406 [2018-10-14 16:23:28,330 INFO L226 Difference]: Without dead ends: 406 [2018-10-14 16:23:28,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-14 16:23:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-14 16:23:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2018-10-14 16:23:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-14 16:23:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-10-14 16:23:28,334 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 400 [2018-10-14 16:23:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:28,334 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-10-14 16:23:28,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 16:23:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-10-14 16:23:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-14 16:23:28,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:28,336 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:28,337 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash -238751892, now seen corresponding path program 88 times [2018-10-14 16:23:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:23:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:23:32,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:23:32,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-14 16:23:32,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-14 16:23:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-14 16:23:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 16:23:32,269 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 92 states. [2018-10-14 16:23:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:37,718 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-14 16:23:37,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 16:23:37,718 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 403 [2018-10-14 16:23:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:37,719 INFO L225 Difference]: With dead ends: 409 [2018-10-14 16:23:37,720 INFO L226 Difference]: Without dead ends: 409 [2018-10-14 16:23:37,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 16:23:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-14 16:23:37,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2018-10-14 16:23:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-14 16:23:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-14 16:23:37,724 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 403 [2018-10-14 16:23:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:37,725 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-14 16:23:37,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-14 16:23:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-14 16:23:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-14 16:23:37,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:37,726 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:37,726 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 103025290, now seen corresponding path program 89 times [2018-10-14 16:23:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:23:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:23:41,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:23:41,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 16:23:41,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 16:23:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 16:23:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 16:23:41,739 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 93 states. [2018-10-14 16:23:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:47,104 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-14 16:23:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 16:23:47,104 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 406 [2018-10-14 16:23:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:47,106 INFO L225 Difference]: With dead ends: 412 [2018-10-14 16:23:47,106 INFO L226 Difference]: Without dead ends: 412 [2018-10-14 16:23:47,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-14 16:23:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-14 16:23:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-10-14 16:23:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-14 16:23:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-10-14 16:23:47,110 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 406 [2018-10-14 16:23:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:47,110 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-10-14 16:23:47,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 16:23:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-10-14 16:23:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-14 16:23:47,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:47,112 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:47,112 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:47,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1380404564, now seen corresponding path program 90 times [2018-10-14 16:23:47,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:23:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:23:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:23:50,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-14 16:23:50,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-14 16:23:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-14 16:23:50,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 16:23:50,983 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 94 states. [2018-10-14 16:23:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:23:56,685 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-14 16:23:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 16:23:56,686 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 409 [2018-10-14 16:23:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:23:56,687 INFO L225 Difference]: With dead ends: 415 [2018-10-14 16:23:56,687 INFO L226 Difference]: Without dead ends: 415 [2018-10-14 16:23:56,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-14 16:23:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-14 16:23:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2018-10-14 16:23:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-14 16:23:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-10-14 16:23:56,692 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 409 [2018-10-14 16:23:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:23:56,692 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-10-14 16:23:56,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-14 16:23:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-10-14 16:23:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-14 16:23:56,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:23:56,694 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:56,694 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:23:56,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:23:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash 974290762, now seen corresponding path program 91 times [2018-10-14 16:23:56,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:23:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:24:00,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:00,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 16:24:00,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 16:24:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 16:24:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 16:24:00,798 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 95 states. [2018-10-14 16:24:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:06,605 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-10-14 16:24:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-14 16:24:06,606 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 412 [2018-10-14 16:24:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:06,607 INFO L225 Difference]: With dead ends: 418 [2018-10-14 16:24:06,607 INFO L226 Difference]: Without dead ends: 418 [2018-10-14 16:24:06,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-14 16:24:06,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-14 16:24:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2018-10-14 16:24:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-14 16:24:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-14 16:24:06,611 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 412 [2018-10-14 16:24:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:06,611 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-14 16:24:06,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 16:24:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-14 16:24:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-14 16:24:06,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:06,613 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:06,613 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:06,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1902060, now seen corresponding path program 92 times [2018-10-14 16:24:06,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:24:10,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:10,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-14 16:24:10,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-14 16:24:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-14 16:24:10,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 16:24:10,857 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 96 states. [2018-10-14 16:24:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:16,493 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-14 16:24:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 16:24:16,493 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 415 [2018-10-14 16:24:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:16,494 INFO L225 Difference]: With dead ends: 421 [2018-10-14 16:24:16,494 INFO L226 Difference]: Without dead ends: 421 [2018-10-14 16:24:16,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-14 16:24:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-14 16:24:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2018-10-14 16:24:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-14 16:24:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-10-14 16:24:16,499 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 415 [2018-10-14 16:24:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:16,499 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-10-14 16:24:16,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-14 16:24:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-10-14 16:24:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-14 16:24:16,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:16,501 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,501 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:16,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:16,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1124492298, now seen corresponding path program 93 times [2018-10-14 16:24:16,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:24:20,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:20,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 16:24:20,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 16:24:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 16:24:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 16:24:20,916 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 97 states. [2018-10-14 16:24:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:27,346 INFO L93 Difference]: Finished difference Result 422 states and 422 transitions. [2018-10-14 16:24:27,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-14 16:24:27,346 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 418 [2018-10-14 16:24:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:27,348 INFO L225 Difference]: With dead ends: 422 [2018-10-14 16:24:27,348 INFO L226 Difference]: Without dead ends: 422 [2018-10-14 16:24:27,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-14 16:24:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-14 16:24:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2018-10-14 16:24:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-14 16:24:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2018-10-14 16:24:27,352 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 418 [2018-10-14 16:24:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:27,352 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2018-10-14 16:24:27,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 16:24:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2018-10-14 16:24:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-14 16:24:27,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:27,354 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:27,354 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:27,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash -700061396, now seen corresponding path program 94 times [2018-10-14 16:24:27,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-14 16:24:27,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:24:27,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-14 16:24:27,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:24:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:24:27,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:24:27,997 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 7 states. [2018-10-14 16:24:28,866 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-14 16:24:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:28,949 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2018-10-14 16:24:28,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:24:28,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 421 [2018-10-14 16:24:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:28,949 INFO L225 Difference]: With dead ends: 420 [2018-10-14 16:24:28,949 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:24:28,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:24:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:24:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:24:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:24:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:24:28,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 421 [2018-10-14 16:24:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:28,950 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:24:28,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:24:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:24:28,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:24:28,955 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_40.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:24:28 BoogieIcfgContainer [2018-10-14 16:24:28,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:24:28,956 INFO L168 Benchmark]: Toolchain (without parser) took 376264.70 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -42.5 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 202.5 MB). Peak memory consumption was 160.1 MB. Max. memory is 7.1 GB. [2018-10-14 16:24:28,957 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:24:28,957 INFO L168 Benchmark]: Boogie Preprocessor took 93.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 16:24:28,958 INFO L168 Benchmark]: RCFGBuilder took 1033.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-14 16:24:28,958 INFO L168 Benchmark]: TraceAbstraction took 375133.12 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -42.5 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 160.2 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. [2018-10-14 16:24:28,961 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1033.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 375133.12 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -42.5 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 160.2 MB). Peak memory consumption was 117.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 212]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. SAFE Result, 375.0s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 213.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12907 SDtfs, 29110 SDslu, 401279 SDs, 0 SdLazy, 29169 SolverSat, 4610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9136 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138421 ImplicationChecksByTransitivity, 322.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 151.3s InterpolantComputationTime, 26600 NumberOfCodeBlocks, 26600 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 26505 ConstructedInterpolants, 0 QuantifiedInterpolants, 25942923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_40.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-24-28-970.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_40.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-24-28-970.csv Received shutdown request...