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_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:17:04,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:17:04,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:17:04,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:17:04,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:17:04,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:17:04,553 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:17:04,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:17:04,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:17:04,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:17:04,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:17:04,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:17:04,560 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:17:04,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:17:04,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:17:04,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:17:04,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:17:04,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:17:04,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:17:04,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:17:04,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:17:04,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:17:04,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:17:04,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:17:04,574 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:17:04,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:17:04,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:17:04,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:17:04,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:17:04,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:17:04,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:17:04,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:17:04,580 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:17:04,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:17:04,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:17:04,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:17:04,583 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:17:04,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:17:04,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:17:04,602 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:17:04,602 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:17:04,603 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:17:04,603 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:17:04,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:17:04,604 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:17:04,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:17:04,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:17:04,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:17:04,604 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:17:04,605 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:17:04,605 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:17:04,606 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:17:04,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:17:04,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:17:04,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:17:04,667 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:17:04,667 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:17:04,668 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_7.bpl [2018-10-10 15:17:04,669 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_7.bpl' [2018-10-10 15:17:04,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:17:04,730 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:17:04,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:17:04,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:17:04,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:17:04,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... [2018-10-10 15:17:04,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:17:04,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:17:04,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:17:04,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:17:04,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:17:04,848 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:17:04,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:17:04,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:17:05,450 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:17:05,451 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:05 BoogieIcfgContainer [2018-10-10 15:17:05,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:17:05,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:17:05,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:17:05,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:17:05,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:04" (1/2) ... [2018-10-10 15:17:05,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aff1ad9 and model type 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:17:05, skipping insertion in model container [2018-10-10 15:17:05,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:05" (2/2) ... [2018-10-10 15:17:05,460 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_7.bpl [2018-10-10 15:17:05,470 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:17:05,478 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:17:05,497 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:17:05,525 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:17:05,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:17:05,526 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:17:05,527 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:17:05,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:17:05,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:17:05,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:17:05,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:17:05,527 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:17:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-10-10 15:17:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 15:17:05,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:05,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] [2018-10-10 15:17:05,576 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:05,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -733595461, now seen corresponding path program 1 times [2018-10-10 15:17:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:05,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:05,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:17:05,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:17:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:17:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:17:05,873 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-10-10 15:17:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:05,986 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-10 15:17:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:17:05,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-10 15:17:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:06,001 INFO L225 Difference]: With dead ends: 47 [2018-10-10 15:17:06,001 INFO L226 Difference]: Without dead ends: 47 [2018-10-10 15:17:06,003 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-10 15:17:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-10 15:17:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-10-10 15:17:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-10 15:17:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-10 15:17:06,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-10-10 15:17:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:06,043 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-10 15:17:06,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:17:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-10 15:17:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-10 15:17:06,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,045 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] [2018-10-10 15:17:06,046 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1339468121, now seen corresponding path program 1 times [2018-10-10 15:17:06,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,229 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-10 15:17:06,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:17:06,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:17:06,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:17:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:17:06,233 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2018-10-10 15:17:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:06,397 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-10 15:17:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:17:06,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-10 15:17:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:06,400 INFO L225 Difference]: With dead ends: 50 [2018-10-10 15:17:06,400 INFO L226 Difference]: Without dead ends: 50 [2018-10-10 15:17:06,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-10 15:17:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-10 15:17:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-10 15:17:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-10 15:17:06,414 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-10-10 15:17:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:06,416 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-10 15:17:06,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:17:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-10 15:17:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 15:17:06,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,419 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] [2018-10-10 15:17:06,423 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1653076997, now seen corresponding path program 2 times [2018-10-10 15:17:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:06,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:06,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:17:06,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:17:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:17:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:17:06,622 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 6 states. [2018-10-10 15:17:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:06,762 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-10 15:17:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:17:06,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-10-10 15:17:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:06,765 INFO L225 Difference]: With dead ends: 53 [2018-10-10 15:17:06,765 INFO L226 Difference]: Without dead ends: 53 [2018-10-10 15:17:06,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-10 15:17:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-10 15:17:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-10 15:17:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-10 15:17:06,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-10-10 15:17:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:06,775 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-10 15:17:06,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:17:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-10 15:17:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 15:17:06,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:06,777 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] [2018-10-10 15:17:06,778 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:06,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1928524263, now seen corresponding path program 3 times [2018-10-10 15:17:06,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:07,002 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-10 15:17:07,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:17:07,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:17:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:17:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:07,004 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 7 states. [2018-10-10 15:17:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:07,171 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-10 15:17:07,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:17:07,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-10 15:17:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:07,173 INFO L225 Difference]: With dead ends: 56 [2018-10-10 15:17:07,173 INFO L226 Difference]: Without dead ends: 56 [2018-10-10 15:17:07,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-10 15:17:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-10-10 15:17:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-10 15:17:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-10 15:17:07,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-10-10 15:17:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:07,181 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-10 15:17:07,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:17:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-10 15:17:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 15:17:07,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,183 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] [2018-10-10 15:17:07,184 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,184 INFO L82 PathProgramCache]: Analyzing trace with hash -95523013, now seen corresponding path program 4 times [2018-10-10 15:17:07,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:07,338 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-10 15:17:07,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:07,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:17:07,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:17:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:17:07,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:17:07,340 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-10-10 15:17:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:07,855 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-10 15:17:07,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:17:07,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-10-10 15:17:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:07,859 INFO L225 Difference]: With dead ends: 59 [2018-10-10 15:17:07,860 INFO L226 Difference]: Without dead ends: 59 [2018-10-10 15:17:07,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-10 15:17:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-10 15:17:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-10 15:17:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-10 15:17:07,867 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-10-10 15:17:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:07,868 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-10 15:17:07,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:17:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-10 15:17:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 15:17:07,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:07,870 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] [2018-10-10 15:17:07,870 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:07,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:07,870 INFO L82 PathProgramCache]: Analyzing trace with hash 630514393, now seen corresponding path program 5 times [2018-10-10 15:17:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,095 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-10 15:17:08,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:08,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:17:08,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:17:08,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:17:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:17:08,098 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 9 states. [2018-10-10 15:17:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:08,285 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-10 15:17:08,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:17:08,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-10-10 15:17:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:08,290 INFO L225 Difference]: With dead ends: 62 [2018-10-10 15:17:08,290 INFO L226 Difference]: Without dead ends: 62 [2018-10-10 15:17:08,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-10 15:17:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-10 15:17:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-10 15:17:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-10 15:17:08,298 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-10-10 15:17:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:08,299 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-10 15:17:08,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:17:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-10 15:17:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-10 15:17:08,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:08,300 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] [2018-10-10 15:17:08,301 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:08,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 555573883, now seen corresponding path program 6 times [2018-10-10 15:17:08,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,610 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-10 15:17:08,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:17:08,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:17:08,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:17:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:17:08,612 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 10 states. [2018-10-10 15:17:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:08,916 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-10 15:17:08,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:17:08,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-10-10 15:17:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:08,918 INFO L225 Difference]: With dead ends: 65 [2018-10-10 15:17:08,918 INFO L226 Difference]: Without dead ends: 65 [2018-10-10 15:17:08,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:17:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-10 15:17:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-10 15:17:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-10 15:17:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-10 15:17:08,928 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-10-10 15:17:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:08,929 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-10 15:17:08,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:17:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-10 15:17:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 15:17:08,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:08,930 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] [2018-10-10 15:17:08,931 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:08,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1385834393, now seen corresponding path program 7 times [2018-10-10 15:17:08,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:09,275 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-10 15:17:09,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:09,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:17:09,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:17:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:17:09,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:17:09,277 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 11 states. [2018-10-10 15:17:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:09,810 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-10 15:17:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:17:09,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-10 15:17:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:09,811 INFO L225 Difference]: With dead ends: 68 [2018-10-10 15:17:09,812 INFO L226 Difference]: Without dead ends: 68 [2018-10-10 15:17:09,812 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-10 15:17:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-10 15:17:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-10-10 15:17:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-10 15:17:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-10 15:17:09,818 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-10-10 15:17:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:09,818 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-10 15:17:09,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:17:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-10 15:17:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 15:17:09,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:09,820 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] [2018-10-10 15:17:09,820 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:09,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 960030139, now seen corresponding path program 8 times [2018-10-10 15:17:09,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:10,080 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-10 15:17:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:10,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:17:10,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:17:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:17:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:10,082 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 12 states. [2018-10-10 15:17:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:10,374 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-10 15:17:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:17:10,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-10-10 15:17:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:10,375 INFO L225 Difference]: With dead ends: 71 [2018-10-10 15:17:10,376 INFO L226 Difference]: Without dead ends: 71 [2018-10-10 15:17:10,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:17:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-10 15:17:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-10-10 15:17:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-10 15:17:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-10 15:17:10,384 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-10-10 15:17:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:10,385 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-10 15:17:10,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:17:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-10 15:17:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-10 15:17:10,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:10,387 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] [2018-10-10 15:17:10,387 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:10,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1136075687, now seen corresponding path program 9 times [2018-10-10 15:17:10,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:10,651 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-10 15:17:10,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:10,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:17:10,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:17:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:17:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:17:10,653 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 13 states. [2018-10-10 15:17:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:10,868 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-10 15:17:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:17:10,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-10-10 15:17:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:10,870 INFO L225 Difference]: With dead ends: 74 [2018-10-10 15:17:10,870 INFO L226 Difference]: Without dead ends: 74 [2018-10-10 15:17:10,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-10 15:17:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-10 15:17:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-10 15:17:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-10 15:17:10,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-10-10 15:17:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:10,877 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-10 15:17:10,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:17:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-10 15:17:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 15:17:10,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:10,878 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] [2018-10-10 15:17:10,879 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:10,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1695221509, now seen corresponding path program 10 times [2018-10-10 15:17:10,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:11,104 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-10 15:17:11,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:11,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:17:11,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:17:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:17:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:17:11,105 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 14 states. [2018-10-10 15:17:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:11,355 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-10 15:17:11,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:17:11,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-10-10 15:17:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:11,357 INFO L225 Difference]: With dead ends: 77 [2018-10-10 15:17:11,358 INFO L226 Difference]: Without dead ends: 77 [2018-10-10 15:17:11,359 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-10 15:17:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-10 15:17:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-10-10 15:17:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-10 15:17:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-10 15:17:11,363 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-10-10 15:17:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:11,363 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-10 15:17:11,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:17:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-10 15:17:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 15:17:11,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:11,365 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] [2018-10-10 15:17:11,366 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:11,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:11,366 INFO L82 PathProgramCache]: Analyzing trace with hash 969736473, now seen corresponding path program 11 times [2018-10-10 15:17:11,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:11,919 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-10 15:17:11,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:11,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:17:11,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:17:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:17:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:17:11,920 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 15 states. [2018-10-10 15:17:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:12,304 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-10 15:17:12,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:17:12,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-10-10 15:17:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:12,306 INFO L225 Difference]: With dead ends: 80 [2018-10-10 15:17:12,306 INFO L226 Difference]: Without dead ends: 80 [2018-10-10 15:17:12,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:17:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-10 15:17:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-10 15:17:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 15:17:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-10 15:17:12,312 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-10-10 15:17:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:12,312 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-10 15:17:12,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:17:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-10 15:17:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 15:17:12,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:12,314 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] [2018-10-10 15:17:12,314 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:12,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 262511675, now seen corresponding path program 12 times [2018-10-10 15:17:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:12,808 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-10 15:17:12,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:12,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:17:12,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:17:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:17:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:17:12,810 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 16 states. [2018-10-10 15:17:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:13,173 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-10 15:17:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:17:13,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-10-10 15:17:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:13,175 INFO L225 Difference]: With dead ends: 83 [2018-10-10 15:17:13,175 INFO L226 Difference]: Without dead ends: 83 [2018-10-10 15:17:13,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:17:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-10 15:17:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-10-10 15:17:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-10 15:17:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-10 15:17:13,180 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-10-10 15:17:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:13,180 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-10 15:17:13,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:17:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-10 15:17:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 15:17:13,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:13,182 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] [2018-10-10 15:17:13,182 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:13,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1856858663, now seen corresponding path program 13 times [2018-10-10 15:17:13,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:14,054 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-10 15:17:14,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:14,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:17:14,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:17:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:17:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:17:14,056 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 17 states. [2018-10-10 15:17:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:14,402 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-10 15:17:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:17:14,402 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-10-10 15:17:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:14,403 INFO L225 Difference]: With dead ends: 86 [2018-10-10 15:17:14,403 INFO L226 Difference]: Without dead ends: 86 [2018-10-10 15:17:14,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-10 15:17:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-10-10 15:17:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 15:17:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-10 15:17:14,408 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-10-10 15:17:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:14,408 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-10 15:17:14,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:17:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-10 15:17:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 15:17:14,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:14,410 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] [2018-10-10 15:17:14,410 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:14,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:14,410 INFO L82 PathProgramCache]: Analyzing trace with hash 295620475, now seen corresponding path program 14 times [2018-10-10 15:17:14,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:14,612 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-10 15:17:14,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:17:14,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:17:14,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:17:14,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:17:14,614 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 18 states. [2018-10-10 15:17:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:15,122 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-10 15:17:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:17:15,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2018-10-10 15:17:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:15,124 INFO L225 Difference]: With dead ends: 89 [2018-10-10 15:17:15,124 INFO L226 Difference]: Without dead ends: 89 [2018-10-10 15:17:15,125 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-10 15:17:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-10 15:17:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-10-10 15:17:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-10 15:17:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-10 15:17:15,129 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-10-10 15:17:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:15,129 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-10 15:17:15,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:17:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-10 15:17:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 15:17:15,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:15,130 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] [2018-10-10 15:17:15,131 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:15,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash 939891353, now seen corresponding path program 15 times [2018-10-10 15:17:15,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:15,933 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-10 15:17:15,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:15,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:17:15,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:17:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:17:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:17:15,935 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 19 states. [2018-10-10 15:17:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:16,294 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-10 15:17:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:17:16,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-10-10 15:17:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:16,296 INFO L225 Difference]: With dead ends: 92 [2018-10-10 15:17:16,296 INFO L226 Difference]: Without dead ends: 92 [2018-10-10 15:17:16,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-10 15:17:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-10-10 15:17:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-10 15:17:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-10 15:17:16,300 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-10-10 15:17:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:16,300 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-10 15:17:16,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:17:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-10 15:17:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 15:17:16,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:16,301 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] [2018-10-10 15:17:16,302 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:16,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash 204772027, now seen corresponding path program 16 times [2018-10-10 15:17:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:16,610 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-10 15:17:16,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:16,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:17:16,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:17:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:17:16,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:17:16,612 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 20 states. [2018-10-10 15:17:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:16,984 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-10 15:17:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:17:16,984 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-10-10 15:17:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:16,986 INFO L225 Difference]: With dead ends: 95 [2018-10-10 15:17:16,986 INFO L226 Difference]: Without dead ends: 95 [2018-10-10 15:17:16,986 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-10 15:17:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-10 15:17:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-10-10 15:17:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-10 15:17:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-10 15:17:16,989 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-10-10 15:17:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:16,989 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-10 15:17:16,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:17:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-10 15:17:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-10 15:17:16,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:16,990 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] [2018-10-10 15:17:16,991 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:16,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash 303173465, now seen corresponding path program 17 times [2018-10-10 15:17:16,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:17,455 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-10 15:17:17,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:17,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:17:17,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:17:17,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:17:17,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:17:17,457 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 21 states. [2018-10-10 15:17:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:18,156 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-10 15:17:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:17:18,157 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-10-10 15:17:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:18,158 INFO L225 Difference]: With dead ends: 98 [2018-10-10 15:17:18,158 INFO L226 Difference]: Without dead ends: 98 [2018-10-10 15:17:18,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:17:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-10 15:17:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-10-10 15:17:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-10 15:17:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-10 15:17:18,162 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-10-10 15:17:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:18,162 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-10 15:17:18,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:17:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-10 15:17:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 15:17:18,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:18,164 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] [2018-10-10 15:17:18,164 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1682250245, now seen corresponding path program 18 times [2018-10-10 15:17:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:18,505 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-10 15:17:18,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:17:18,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:17:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:17:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:17:18,507 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 22 states. [2018-10-10 15:17:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:18,918 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 15:17:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:17:18,918 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 95 [2018-10-10 15:17:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:18,919 INFO L225 Difference]: With dead ends: 101 [2018-10-10 15:17:18,919 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 15:17:18,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:17:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 15:17:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-10 15:17:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-10 15:17:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-10 15:17:18,923 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-10-10 15:17:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:18,923 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-10 15:17:18,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:17:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-10 15:17:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 15:17:18,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:18,924 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] [2018-10-10 15:17:18,925 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:18,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash 849605657, now seen corresponding path program 19 times [2018-10-10 15:17:18,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:19,849 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-10 15:17:19,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:19,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:17:19,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:17:19,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:17:19,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:17:19,851 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 23 states. [2018-10-10 15:17:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:20,316 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-10 15:17:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:17:20,317 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2018-10-10 15:17:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:20,318 INFO L225 Difference]: With dead ends: 104 [2018-10-10 15:17:20,318 INFO L226 Difference]: Without dead ends: 104 [2018-10-10 15:17:20,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:17:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-10 15:17:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-10-10 15:17:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 15:17:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 15:17:20,322 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-10-10 15:17:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:20,322 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 15:17:20,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:17:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 15:17:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 15:17:20,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:20,323 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] [2018-10-10 15:17:20,323 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:20,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:20,323 INFO L82 PathProgramCache]: Analyzing trace with hash -846870213, now seen corresponding path program 20 times [2018-10-10 15:17:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:21,433 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-10 15:17:21,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:21,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:17:21,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:17:21,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:17:21,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:17:21,435 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 24 states. [2018-10-10 15:17:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:21,922 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 15:17:21,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:17:21,922 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-10-10 15:17:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:21,923 INFO L225 Difference]: With dead ends: 107 [2018-10-10 15:17:21,923 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 15:17:21,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:17:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 15:17:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-10-10 15:17:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-10 15:17:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-10 15:17:21,928 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-10-10 15:17:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:21,929 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-10 15:17:21,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:17:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-10 15:17:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 15:17:21,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:21,930 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] [2018-10-10 15:17:21,930 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:21,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1679341351, now seen corresponding path program 21 times [2018-10-10 15:17:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:22,308 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-10 15:17:22,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:22,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:17:22,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:17:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:17:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:17:22,310 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 25 states. [2018-10-10 15:17:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:23,109 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-10 15:17:23,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:17:23,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 104 [2018-10-10 15:17:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:23,114 INFO L225 Difference]: With dead ends: 110 [2018-10-10 15:17:23,114 INFO L226 Difference]: Without dead ends: 110 [2018-10-10 15:17:23,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:17:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-10 15:17:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-10-10 15:17:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 15:17:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 15:17:23,118 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-10-10 15:17:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:23,118 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 15:17:23,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:17:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 15:17:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 15:17:23,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:23,119 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] [2018-10-10 15:17:23,120 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:23,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:23,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1609120891, now seen corresponding path program 22 times [2018-10-10 15:17:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:23,638 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-10 15:17:23,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:23,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:17:23,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:17:23,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:17:23,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:17:23,640 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 26 states. [2018-10-10 15:17:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:24,280 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:17:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:17:24,281 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 107 [2018-10-10 15:17:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:24,282 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:17:24,282 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:17:24,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:17:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:17:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-10-10 15:17:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-10 15:17:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-10 15:17:24,286 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-10-10 15:17:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:24,286 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-10 15:17:24,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:17:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-10 15:17:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 15:17:24,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:24,287 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] [2018-10-10 15:17:24,287 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:24,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:24,288 INFO L82 PathProgramCache]: Analyzing trace with hash -16249447, now seen corresponding path program 23 times [2018-10-10 15:17:24,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:24,682 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-10 15:17:24,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:24,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:17:24,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:17:24,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:17:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:24,683 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 27 states. [2018-10-10 15:17:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:25,279 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-10 15:17:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:17:25,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-10-10 15:17:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:25,280 INFO L225 Difference]: With dead ends: 116 [2018-10-10 15:17:25,281 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 15:17:25,282 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-10 15:17:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 15:17:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-10 15:17:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 15:17:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 15:17:25,285 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-10-10 15:17:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:25,285 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 15:17:25,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:17:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 15:17:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 15:17:25,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:25,286 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] [2018-10-10 15:17:25,286 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:25,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 37306299, now seen corresponding path program 24 times [2018-10-10 15:17:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:25,673 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-10 15:17:25,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:25,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:17:25,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:17:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:17:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:17:25,674 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 28 states. [2018-10-10 15:17:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:26,223 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-10 15:17:26,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:17:26,224 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2018-10-10 15:17:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:26,225 INFO L225 Difference]: With dead ends: 119 [2018-10-10 15:17:26,225 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 15:17:26,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:17:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 15:17:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-10 15:17:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-10 15:17:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-10 15:17:26,228 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-10-10 15:17:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:26,229 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-10 15:17:26,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:17:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-10 15:17:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 15:17:26,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:26,229 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] [2018-10-10 15:17:26,230 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:26,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2083668569, now seen corresponding path program 25 times [2018-10-10 15:17:26,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:26,671 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-10 15:17:26,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:26,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:17:26,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:17:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:17:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:17:26,673 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 29 states. [2018-10-10 15:17:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:27,349 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-10 15:17:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:17:27,353 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 116 [2018-10-10 15:17:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:27,354 INFO L225 Difference]: With dead ends: 122 [2018-10-10 15:17:27,354 INFO L226 Difference]: Without dead ends: 122 [2018-10-10 15:17:27,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:17:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-10 15:17:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-10-10 15:17:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 15:17:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-10 15:17:27,358 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-10 15:17:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:27,359 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-10 15:17:27,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:17:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-10 15:17:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 15:17:27,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:27,360 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] [2018-10-10 15:17:27,360 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:27,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1798712581, now seen corresponding path program 26 times [2018-10-10 15:17:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:28,347 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-10 15:17:28,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:28,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:17:28,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:17:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:17:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:17:28,349 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 30 states. [2018-10-10 15:17:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:29,136 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-10 15:17:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:17:29,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-10-10 15:17:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:29,137 INFO L225 Difference]: With dead ends: 125 [2018-10-10 15:17:29,137 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 15:17:29,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:17:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 15:17:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-10 15:17:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 15:17:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-10 15:17:29,141 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-10 15:17:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:29,141 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-10 15:17:29,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:17:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-10 15:17:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 15:17:29,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:29,142 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] [2018-10-10 15:17:29,142 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:29,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1653729049, now seen corresponding path program 27 times [2018-10-10 15:17:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:29,623 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-10 15:17:29,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:29,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:17:29,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:17:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:17:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:17:29,625 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 31 states. [2018-10-10 15:17:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:30,346 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-10 15:17:30,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:17:30,346 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 122 [2018-10-10 15:17:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:30,347 INFO L225 Difference]: With dead ends: 128 [2018-10-10 15:17:30,348 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 15:17:30,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:17:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 15:17:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-10 15:17:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 15:17:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-10 15:17:30,353 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-10 15:17:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:30,353 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-10 15:17:30,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:17:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-10 15:17:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 15:17:30,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:30,354 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] [2018-10-10 15:17:30,354 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:30,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:30,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1760491067, now seen corresponding path program 28 times [2018-10-10 15:17:30,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:30,862 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-10 15:17:30,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:30,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:17:30,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:17:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:17:30,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:17:30,863 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 32 states. [2018-10-10 15:17:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:31,906 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-10 15:17:31,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:17:31,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 125 [2018-10-10 15:17:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:31,908 INFO L225 Difference]: With dead ends: 131 [2018-10-10 15:17:31,908 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 15:17:31,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:17:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 15:17:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-10 15:17:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 15:17:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-10 15:17:31,912 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-10 15:17:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:31,912 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-10 15:17:31,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:17:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-10 15:17:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 15:17:31,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:31,913 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] [2018-10-10 15:17:31,914 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:31,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash -262997031, now seen corresponding path program 29 times [2018-10-10 15:17:31,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:33,356 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-10 15:17:33,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:33,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:17:33,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:17:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:17:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:17:33,358 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 33 states. [2018-10-10 15:17:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:34,255 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-10 15:17:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:17:34,256 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 128 [2018-10-10 15:17:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:34,258 INFO L225 Difference]: With dead ends: 134 [2018-10-10 15:17:34,258 INFO L226 Difference]: Without dead ends: 134 [2018-10-10 15:17:34,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:17:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-10 15:17:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-10 15:17:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 15:17:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-10 15:17:34,261 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-10 15:17:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:34,262 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-10 15:17:34,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:17:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-10 15:17:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 15:17:34,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:34,262 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] [2018-10-10 15:17:34,263 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:34,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2130925189, now seen corresponding path program 30 times [2018-10-10 15:17:34,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:35,102 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-10 15:17:35,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:35,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:17:35,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:17:35,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:17:35,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:17:35,104 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 34 states. [2018-10-10 15:17:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:35,931 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 15:17:35,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:17:35,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 131 [2018-10-10 15:17:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:35,932 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:17:35,932 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:17:35,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:17:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:17:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-10 15:17:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 15:17:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-10 15:17:35,936 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-10 15:17:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:35,937 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-10 15:17:35,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:17:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-10 15:17:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 15:17:35,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:35,938 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] [2018-10-10 15:17:35,938 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:35,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:35,939 INFO L82 PathProgramCache]: Analyzing trace with hash 312574105, now seen corresponding path program 31 times [2018-10-10 15:17:35,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:36,517 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-10 15:17:36,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:36,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:17:36,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:17:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:17:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:17:36,519 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 35 states. [2018-10-10 15:17:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:37,509 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-10 15:17:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:17:37,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-10 15:17:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:37,511 INFO L225 Difference]: With dead ends: 140 [2018-10-10 15:17:37,511 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 15:17:37,513 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-10 15:17:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 15:17:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-10-10 15:17:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 15:17:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 15:17:37,516 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-10 15:17:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:37,516 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 15:17:37,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:17:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 15:17:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:17:37,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:37,517 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] [2018-10-10 15:17:37,518 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:37,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash -800658245, now seen corresponding path program 32 times [2018-10-10 15:17:37,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:38,772 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-10 15:17:38,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:38,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:17:38,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:17:38,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:17:38,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:17:38,775 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 36 states. [2018-10-10 15:17:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:39,705 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:17:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:17:39,706 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 137 [2018-10-10 15:17:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:39,708 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:17:39,708 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:17:39,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:17:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:17:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-10 15:17:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 15:17:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-10 15:17:39,712 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-10 15:17:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:39,713 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-10 15:17:39,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:17:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-10 15:17:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:17:39,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:39,714 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] [2018-10-10 15:17:39,714 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:39,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash 631862617, now seen corresponding path program 33 times [2018-10-10 15:17:39,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:40,970 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-10 15:17:40,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:40,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:17:40,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:17:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:17:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:17:40,972 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 37 states. [2018-10-10 15:17:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:42,792 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-10 15:17:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:17:42,792 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2018-10-10 15:17:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:42,794 INFO L225 Difference]: With dead ends: 146 [2018-10-10 15:17:42,794 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 15:17:42,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:17:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 15:17:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-10 15:17:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:17:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:17:42,797 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-10 15:17:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:42,797 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:17:42,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:17:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:17:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:17:42,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:42,798 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] [2018-10-10 15:17:42,798 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:42,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2065809403, now seen corresponding path program 34 times [2018-10-10 15:17:42,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:44,104 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-10 15:17:44,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:44,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:17:44,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:17:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:17:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:17:44,105 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 38 states. [2018-10-10 15:17:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:45,102 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:17:45,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:17:45,103 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2018-10-10 15:17:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:45,107 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:17:45,107 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:17:45,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:17:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:17:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-10 15:17:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 15:17:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-10 15:17:45,111 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-10 15:17:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:45,112 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-10 15:17:45,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:17:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-10 15:17:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-10 15:17:45,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:45,113 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] [2018-10-10 15:17:45,113 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:45,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:45,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1265182183, now seen corresponding path program 35 times [2018-10-10 15:17:45,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:45,877 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-10 15:17:45,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:17:45,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:17:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:17:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:17:45,878 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 39 states. [2018-10-10 15:17:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:46,967 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-10 15:17:46,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:17:46,967 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 146 [2018-10-10 15:17:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:46,968 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:17:46,968 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:17:46,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:17:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:17:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-10 15:17:46,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:17:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:17:46,972 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-10 15:17:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:46,972 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:17:46,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:17:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:17:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:17:46,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:46,974 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] [2018-10-10 15:17:46,974 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:46,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash 383853371, now seen corresponding path program 36 times [2018-10-10 15:17:46,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:47,991 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-10 15:17:47,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:47,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:17:47,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:17:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:17:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:17:47,992 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 40 states. [2018-10-10 15:17:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:50,360 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 15:17:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:17:50,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 149 [2018-10-10 15:17:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:50,362 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:17:50,362 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:17:50,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:17:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:17:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-10 15:17:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 15:17:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-10 15:17:50,366 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-10 15:17:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:50,367 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-10 15:17:50,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:17:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-10 15:17:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 15:17:50,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:50,368 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] [2018-10-10 15:17:50,368 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:50,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 966110937, now seen corresponding path program 37 times [2018-10-10 15:17:50,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:51,225 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-10 15:17:51,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:51,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:17:51,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:17:51,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:17:51,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:17:51,226 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 41 states. [2018-10-10 15:17:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:52,408 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-10 15:17:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:17:52,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 152 [2018-10-10 15:17:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:52,410 INFO L225 Difference]: With dead ends: 158 [2018-10-10 15:17:52,410 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 15:17:52,411 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-10 15:17:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 15:17:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-10-10 15:17:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:17:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 15:17:52,415 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-10 15:17:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:52,415 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 15:17:52,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:17:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 15:17:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:17:52,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:52,416 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] [2018-10-10 15:17:52,416 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:52,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -371648901, now seen corresponding path program 38 times [2018-10-10 15:17:52,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:53,296 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-10 15:17:53,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:53,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:17:53,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:17:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:17:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:17:53,297 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 42 states. [2018-10-10 15:17:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:54,730 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:17:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:17:54,730 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 155 [2018-10-10 15:17:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:54,731 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:17:54,731 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:17:54,733 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-10 15:17:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:17:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-10 15:17:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 15:17:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-10 15:17:54,737 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-10 15:17:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:54,737 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-10 15:17:54,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:17:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-10 15:17:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 15:17:54,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:54,738 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] [2018-10-10 15:17:54,738 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:54,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash -573443175, now seen corresponding path program 39 times [2018-10-10 15:17:54,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:55,573 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-10 15:17:55,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:55,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:17:55,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:17:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:17:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:17:55,575 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 43 states. [2018-10-10 15:17:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:56,856 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-10 15:17:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:17:56,857 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 158 [2018-10-10 15:17:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:56,858 INFO L225 Difference]: With dead ends: 164 [2018-10-10 15:17:56,858 INFO L226 Difference]: Without dead ends: 164 [2018-10-10 15:17:56,859 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-10 15:17:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-10 15:17:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-10 15:17:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:17:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:17:56,863 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-10 15:17:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:56,863 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:17:56,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:17:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:17:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:17:56,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:56,865 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] [2018-10-10 15:17:56,865 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:56,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 727554491, now seen corresponding path program 40 times [2018-10-10 15:17:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:57,812 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-10 15:17:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:17:57,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:17:57,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:17:57,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:17:57,813 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 44 states. [2018-10-10 15:17:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:59,356 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:17:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:17:59,356 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 161 [2018-10-10 15:17:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:59,357 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:17:59,357 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:17:59,358 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-10 15:17:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:17:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-10 15:17:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:17:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 15:17:59,361 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-10 15:17:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:59,361 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 15:17:59,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:17:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 15:17:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:17:59,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:59,362 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] [2018-10-10 15:17:59,362 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:59,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 964143193, now seen corresponding path program 41 times [2018-10-10 15:17:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:00,490 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-10 15:18:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:00,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:18:00,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:18:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:18:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:18:00,491 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 45 states. [2018-10-10 15:18:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:02,271 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-10 15:18:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:18:02,271 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 164 [2018-10-10 15:18:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:02,273 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:18:02,273 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:18:02,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:18:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:18:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:18:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:18:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:18:02,276 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-10 15:18:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:02,276 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:18:02,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:18:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:18:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:18:02,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:02,278 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] [2018-10-10 15:18:02,278 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:02,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1136831739, now seen corresponding path program 42 times [2018-10-10 15:18:02,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:03,273 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-10 15:18:03,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:03,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:18:03,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:18:03,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:18:03,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:18:03,275 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 46 states. [2018-10-10 15:18:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:04,940 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:18:04,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:18:04,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 167 [2018-10-10 15:18:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:04,941 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:18:04,941 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:18:04,942 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-10 15:18:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:18:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:18:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:18:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:18:04,945 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-10 15:18:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:04,946 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:18:04,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:18:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:18:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:18:04,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:04,947 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] [2018-10-10 15:18:04,947 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:04,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 330485017, now seen corresponding path program 43 times [2018-10-10 15:18:04,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:06,140 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-10 15:18:06,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:06,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:18:06,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:18:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:18:06,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:18:06,141 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 47 states. [2018-10-10 15:18:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:07,657 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:18:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:18:07,658 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 170 [2018-10-10 15:18:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:07,659 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:18:07,659 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:18:07,659 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-10 15:18:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:18:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:18:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:18:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:18:07,663 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-10 15:18:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:07,663 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:18:07,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:18:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:18:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:18:07,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:07,664 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] [2018-10-10 15:18:07,665 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:07,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 207376443, now seen corresponding path program 44 times [2018-10-10 15:18:07,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:08,801 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-10 15:18:08,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:08,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:18:08,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:18:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:18:08,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:18:08,802 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 48 states. [2018-10-10 15:18:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:10,502 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:18:10,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:18:10,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 173 [2018-10-10 15:18:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:10,503 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:18:10,504 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:18:10,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:18:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:18:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:18:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:18:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-10 15:18:10,506 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-10 15:18:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:10,507 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-10 15:18:10,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:18:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-10 15:18:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-10 15:18:10,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:10,507 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] [2018-10-10 15:18:10,508 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:10,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash 581919193, now seen corresponding path program 45 times [2018-10-10 15:18:10,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:11,638 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-10 15:18:11,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:11,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:18:11,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:18:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:18:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:18:11,640 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 49 states. [2018-10-10 15:18:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:13,208 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-10 15:18:13,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:18:13,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 176 [2018-10-10 15:18:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:13,210 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:18:13,211 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:18:13,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:18:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:18:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:18:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:18:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:18:13,214 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-10 15:18:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:13,214 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:18:13,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:18:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:18:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:18:13,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:13,215 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] [2018-10-10 15:18:13,216 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:13,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 259949435, now seen corresponding path program 46 times [2018-10-10 15:18:13,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:14,767 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-10 15:18:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:18:14,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:18:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:18:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:18:14,768 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 50 states. [2018-10-10 15:18:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:16,355 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:18:16,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:18:16,356 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 179 [2018-10-10 15:18:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:16,357 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:18:16,357 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:18:16,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:18:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:18:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:18:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:18:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-10 15:18:16,360 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-10 15:18:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:16,360 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-10 15:18:16,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:18:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-10 15:18:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:18:16,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:16,361 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] [2018-10-10 15:18:16,361 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:16,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash -879139175, now seen corresponding path program 47 times [2018-10-10 15:18:16,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:18,446 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-10 15:18:18,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:18,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:18:18,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:18:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:18:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:18:18,448 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 51 states. [2018-10-10 15:18:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:20,386 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-10 15:18:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:18:20,387 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 182 [2018-10-10 15:18:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:20,388 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:18:20,388 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:18:20,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:18:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:18:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:18:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:18:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:18:20,392 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-10 15:18:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:20,393 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:18:20,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:18:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:18:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:18:20,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:20,394 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] [2018-10-10 15:18:20,394 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:20,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -931313989, now seen corresponding path program 48 times [2018-10-10 15:18:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:22,190 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-10 15:18:22,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:22,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:18:22,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:18:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:18:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:18:22,191 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 52 states. [2018-10-10 15:18:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:23,925 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:18:23,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:18:23,926 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 185 [2018-10-10 15:18:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:23,927 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:18:23,927 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:18:23,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:18:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:18:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:18:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:18:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-10 15:18:23,932 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-10 15:18:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:23,932 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-10 15:18:23,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:18:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-10 15:18:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-10 15:18:23,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:23,933 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] [2018-10-10 15:18:23,933 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:23,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -493036711, now seen corresponding path program 49 times [2018-10-10 15:18:23,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:25,492 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-10 15:18:25,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:25,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:18:25,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:18:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:18:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:18:25,494 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 53 states. [2018-10-10 15:18:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:27,388 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:18:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:18:27,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 188 [2018-10-10 15:18:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:27,390 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:18:27,390 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:18:27,391 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-10 15:18:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:18:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:18:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:18:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:18:27,393 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-10 15:18:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:27,394 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:18:27,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:18:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:18:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:18:27,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:27,395 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] [2018-10-10 15:18:27,395 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:27,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -475227653, now seen corresponding path program 50 times [2018-10-10 15:18:27,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:28,696 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-10 15:18:28,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:28,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:18:28,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:18:28,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:18:28,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:18:28,698 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 54 states. [2018-10-10 15:18:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:31,008 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:18:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:18:31,009 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 191 [2018-10-10 15:18:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:31,010 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:18:31,010 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:18:31,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:18:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:18:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:18:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:18:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 15:18:31,013 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-10 15:18:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:31,014 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 15:18:31,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:18:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 15:18:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-10 15:18:31,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:31,015 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] [2018-10-10 15:18:31,016 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:31,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1793441817, now seen corresponding path program 51 times [2018-10-10 15:18:31,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:32,372 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-10 15:18:32,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:32,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:18:32,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:18:32,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:18:32,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:18:32,374 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 55 states. [2018-10-10 15:18:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:34,720 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 15:18:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:18:34,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 194 [2018-10-10 15:18:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:34,721 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:18:34,721 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:18:34,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 15:18:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:18:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:18:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:18:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 15:18:34,725 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-10 15:18:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:34,725 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 15:18:34,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:18:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 15:18:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:18:34,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:34,726 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] [2018-10-10 15:18:34,727 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:34,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2120252731, now seen corresponding path program 52 times [2018-10-10 15:18:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:36,053 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-10 15:18:36,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:18:36,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:18:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:18:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:18:36,055 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 56 states. [2018-10-10 15:18:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:38,048 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-10 15:18:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:18:38,049 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 197 [2018-10-10 15:18:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:38,050 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:18:38,050 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:18:38,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:18:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:18:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:18:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:18:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 15:18:38,056 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-10 15:18:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:38,056 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 15:18:38,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:18:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 15:18:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:18:38,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:38,057 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] [2018-10-10 15:18:38,058 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:38,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1453331673, now seen corresponding path program 53 times [2018-10-10 15:18:38,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:39,412 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-10 15:18:39,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:39,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:18:39,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:18:39,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:18:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:18:39,413 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 57 states. [2018-10-10 15:18:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:41,799 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 15:18:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:18:41,799 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 200 [2018-10-10 15:18:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:41,800 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:18:41,800 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:18:41,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:18:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:18:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:18:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:18:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 15:18:41,805 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-10 15:18:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:41,805 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 15:18:41,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:18:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 15:18:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-10 15:18:41,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:41,806 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] [2018-10-10 15:18:41,807 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:41,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1726804091, now seen corresponding path program 54 times [2018-10-10 15:18:41,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:43,346 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-10 15:18:43,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:43,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:18:43,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:18:43,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:18:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:18:43,348 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 58 states. [2018-10-10 15:18:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:45,845 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 15:18:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:18:45,846 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 203 [2018-10-10 15:18:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:45,847 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:18:45,847 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:18:45,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:18:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:18:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:18:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:18:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 15:18:45,850 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-10 15:18:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:45,850 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 15:18:45,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:18:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 15:18:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:18:45,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:45,851 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] [2018-10-10 15:18:45,851 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:45,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1190648217, now seen corresponding path program 55 times [2018-10-10 15:18:45,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:47,483 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-10 15:18:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:18:47,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:18:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:18:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:18:47,484 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 59 states. [2018-10-10 15:18:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:49,957 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-10 15:18:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:18:49,958 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 206 [2018-10-10 15:18:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:49,958 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:18:49,958 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:18:49,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:18:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:18:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:18:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:18:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 15:18:49,961 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-10 15:18:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:49,961 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 15:18:49,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:18:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 15:18:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:18:49,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:49,962 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] [2018-10-10 15:18:49,962 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:49,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1554379707, now seen corresponding path program 56 times [2018-10-10 15:18:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:51,533 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-10 15:18:51,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:51,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:18:51,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:18:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:18:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:18:51,534 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 60 states. [2018-10-10 15:18:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:53,816 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 15:18:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:18:53,816 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 209 [2018-10-10 15:18:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:53,818 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:18:53,818 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:18:53,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:18:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:18:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:18:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:18:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-10 15:18:53,820 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-10 15:18:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:53,821 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-10 15:18:53,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:18:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-10 15:18:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:18:53,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:53,822 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] [2018-10-10 15:18:53,822 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:53,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1276710489, now seen corresponding path program 57 times [2018-10-10 15:18:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:56,111 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-10 15:18:56,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:56,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:18:56,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:18:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:18:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:18:56,113 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 61 states. [2018-10-10 15:18:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:58,580 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:18:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:18:58,581 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 212 [2018-10-10 15:18:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:58,582 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:18:58,582 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:18:58,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:18:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:18:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:18:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:18:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-10 15:18:58,585 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-10 15:18:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:58,586 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-10 15:18:58,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:18:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-10 15:18:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:18:58,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:58,587 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] [2018-10-10 15:18:58,587 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:58,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1340049147, now seen corresponding path program 58 times [2018-10-10 15:18:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:00,407 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-10 15:19:00,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:00,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:19:00,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:19:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:19:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:19:00,409 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 62 states. [2018-10-10 15:19:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:02,977 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-10 15:19:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:19:02,978 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 215 [2018-10-10 15:19:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:02,978 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:19:02,979 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:19:02,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:19:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:19:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:19:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:19:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-10 15:19:02,982 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-10 15:19:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:02,983 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-10 15:19:02,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:19:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-10 15:19:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-10 15:19:02,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:02,984 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] [2018-10-10 15:19:02,984 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:02,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1523600615, now seen corresponding path program 59 times [2018-10-10 15:19:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:04,805 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-10 15:19:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:04,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:19:04,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:19:04,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:19:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:19:04,806 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 63 states. [2018-10-10 15:19:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:07,603 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-10 15:19:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:19:07,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 218 [2018-10-10 15:19:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:07,604 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:19:07,604 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:19:07,605 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-10 15:19:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:19:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:19:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:19:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-10 15:19:07,607 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-10 15:19:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:07,607 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-10 15:19:07,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:19:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-10 15:19:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:19:07,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:07,608 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] [2018-10-10 15:19:07,608 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:07,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1578259909, now seen corresponding path program 60 times [2018-10-10 15:19:07,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:09,426 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-10 15:19:09,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:09,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:19:09,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:19:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:19:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:19:09,427 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 64 states. [2018-10-10 15:19:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:12,298 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-10 15:19:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:19:12,299 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 221 [2018-10-10 15:19:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:12,300 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:19:12,300 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:19:12,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:19:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:19:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:19:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:19:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-10 15:19:12,303 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-10 15:19:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:12,304 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-10 15:19:12,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:19:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-10 15:19:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-10 15:19:12,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:12,305 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] [2018-10-10 15:19:12,305 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:12,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2140682279, now seen corresponding path program 61 times [2018-10-10 15:19:12,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:14,096 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-10 15:19:14,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:14,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:19:14,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:19:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:19:14,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:19:14,097 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 65 states. [2018-10-10 15:19:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:16,946 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-10 15:19:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:19:16,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 224 [2018-10-10 15:19:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:16,948 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:19:16,948 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:19:16,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:19:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:19:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:19:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:19:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-10 15:19:16,952 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-10 15:19:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:16,952 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-10 15:19:16,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:19:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-10 15:19:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 15:19:16,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:16,953 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] [2018-10-10 15:19:16,953 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:16,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1696882043, now seen corresponding path program 62 times [2018-10-10 15:19:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:18,850 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-10 15:19:18,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:18,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:19:18,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:19:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:19:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:19:18,852 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 66 states. [2018-10-10 15:19:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:21,849 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 15:19:21,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:19:21,850 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 227 [2018-10-10 15:19:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:21,851 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:19:21,851 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:19:21,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:19:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:19:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:19:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:19:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-10 15:19:21,855 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-10 15:19:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:21,855 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-10 15:19:21,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:19:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-10 15:19:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:19:21,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:21,856 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] [2018-10-10 15:19:21,857 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:21,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:21,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1158853479, now seen corresponding path program 63 times [2018-10-10 15:19:21,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:23,709 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-10 15:19:23,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:19:23,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:19:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:19:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:19:23,711 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 67 states. [2018-10-10 15:19:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:26,790 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-10 15:19:26,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:19:26,790 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 230 [2018-10-10 15:19:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:26,791 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:19:26,791 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:19:26,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:19:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:19:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:19:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:19:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:19:26,795 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-10 15:19:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:26,795 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:19:26,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:19:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:19:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:19:26,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:26,797 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] [2018-10-10 15:19:26,797 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:26,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1663590213, now seen corresponding path program 64 times [2018-10-10 15:19:26,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:28,716 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-10 15:19:28,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:28,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:19:28,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:19:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:19:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:19:28,718 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 68 states. [2018-10-10 15:19:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:31,943 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-10 15:19:31,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:19:31,944 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 233 [2018-10-10 15:19:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:31,945 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:19:31,945 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:19:31,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:19:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:19:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:19:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:19:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-10 15:19:31,947 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-10 15:19:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:31,948 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-10 15:19:31,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:19:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-10 15:19:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 15:19:31,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:31,949 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] [2018-10-10 15:19:31,949 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:31,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1595129511, now seen corresponding path program 65 times [2018-10-10 15:19:31,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:33,909 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-10 15:19:33,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:33,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:19:33,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:19:33,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:19:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:19:33,911 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 69 states. [2018-10-10 15:19:37,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:37,146 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-10 15:19:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:19:37,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 236 [2018-10-10 15:19:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:37,148 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:19:37,148 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:19:37,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:19:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:19:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:19:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:19:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-10 15:19:37,151 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-10 15:19:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:37,151 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-10 15:19:37,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:19:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-10 15:19:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-10 15:19:37,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:37,152 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] [2018-10-10 15:19:37,152 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:37,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2103145467, now seen corresponding path program 66 times [2018-10-10 15:19:37,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:39,171 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-10 15:19:39,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:39,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:19:39,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:19:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:19:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:19:39,173 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 70 states. [2018-10-10 15:19:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:42,391 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-10 15:19:42,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:19:42,392 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 239 [2018-10-10 15:19:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:42,393 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:19:42,393 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:19:42,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:19:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:19:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:19:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:19:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-10 15:19:42,396 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-10 15:19:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:42,396 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-10 15:19:42,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:19:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-10 15:19:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 15:19:42,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:42,398 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] [2018-10-10 15:19:42,398 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:42,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1383029223, now seen corresponding path program 67 times [2018-10-10 15:19:42,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:44,489 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-10 15:19:44,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:44,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:19:44,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:19:44,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:19:44,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:19:44,490 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 71 states. [2018-10-10 15:19:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:47,887 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-10 15:19:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:19:47,887 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 242 [2018-10-10 15:19:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:47,888 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:19:47,888 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:19:47,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:19:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:19:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:19:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:19:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-10 15:19:47,891 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-10 15:19:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:47,892 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-10 15:19:47,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:19:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-10 15:19:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-10 15:19:47,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:47,893 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] [2018-10-10 15:19:47,894 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:47,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1409034437, now seen corresponding path program 68 times [2018-10-10 15:19:47,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:50,045 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-10 15:19:50,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:19:50,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:19:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:19:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:19:50,047 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 72 states. [2018-10-10 15:19:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:53,388 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-10 15:19:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:19:53,388 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 245 [2018-10-10 15:19:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:53,389 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:19:53,389 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:19:53,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:19:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:19:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:19:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:19:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 15:19:53,392 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-10 15:19:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:53,393 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 15:19:53,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:19:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 15:19:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 15:19:53,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:53,394 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] [2018-10-10 15:19:53,394 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:53,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:53,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1258715865, now seen corresponding path program 69 times [2018-10-10 15:19:53,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:55,687 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-10 15:19:55,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:55,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:19:55,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:19:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:19:55,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:19:55,689 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 73 states. [2018-10-10 15:19:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:59,258 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-10 15:19:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:19:59,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 248 [2018-10-10 15:19:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:59,260 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:19:59,260 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:19:59,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:19:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:19:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:19:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:19:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-10 15:19:59,263 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-10 15:19:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:59,263 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-10 15:19:59,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:19:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-10 15:19:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 15:19:59,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:59,264 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] [2018-10-10 15:19:59,264 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:59,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2133117563, now seen corresponding path program 70 times [2018-10-10 15:19:59,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:01,847 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-10 15:20:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:01,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:20:01,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:20:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:20:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:20:01,848 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 74 states. [2018-10-10 15:20:05,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:05,098 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-10 15:20:05,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:20:05,099 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 251 [2018-10-10 15:20:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:05,100 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:20:05,100 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:20:05,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:20:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:20:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:20:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:20:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:20:05,103 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-10 15:20:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:05,104 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:20:05,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:20:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:20:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:20:05,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:05,105 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] [2018-10-10 15:20:05,106 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:05,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1837514855, now seen corresponding path program 71 times [2018-10-10 15:20:05,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:07,772 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-10 15:20:07,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:07,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:20:07,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:20:07,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:20:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:20:07,774 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 75 states. [2018-10-10 15:20:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:11,427 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-10 15:20:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:20:11,428 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 254 [2018-10-10 15:20:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:11,429 INFO L225 Difference]: With dead ends: 260 [2018-10-10 15:20:11,429 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 15:20:11,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:20:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 15:20:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-10 15:20:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-10 15:20:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-10 15:20:11,432 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-10 15:20:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:11,432 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-10 15:20:11,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:20:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-10 15:20:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-10 15:20:11,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:11,434 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] [2018-10-10 15:20:11,434 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:11,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1041386939, now seen corresponding path program 72 times [2018-10-10 15:20:11,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:14,094 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-10 15:20:14,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:14,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:20:14,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:20:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:20:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:20:14,096 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 76 states. [2018-10-10 15:20:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:17,984 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-10 15:20:17,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:20:17,985 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 257 [2018-10-10 15:20:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:17,986 INFO L225 Difference]: With dead ends: 263 [2018-10-10 15:20:17,986 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 15:20:17,987 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-10 15:20:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 15:20:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-10 15:20:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-10 15:20:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-10 15:20:17,989 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-10 15:20:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:17,989 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-10 15:20:17,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:20:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-10 15:20:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-10 15:20:17,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:17,990 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] [2018-10-10 15:20:17,990 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:17,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 202798169, now seen corresponding path program 73 times [2018-10-10 15:20:17,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:20,425 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-10 15:20:20,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:20,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:20:20,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:20:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:20:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:20:20,427 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 77 states. [2018-10-10 15:20:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:24,326 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-10 15:20:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:20:24,327 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 260 [2018-10-10 15:20:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:24,327 INFO L225 Difference]: With dead ends: 266 [2018-10-10 15:20:24,328 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 15:20:24,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:20:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 15:20:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-10 15:20:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 15:20:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-10 15:20:24,330 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-10 15:20:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:24,330 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-10 15:20:24,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:20:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-10 15:20:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-10 15:20:24,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:24,332 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] [2018-10-10 15:20:24,332 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:24,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1629511931, now seen corresponding path program 74 times [2018-10-10 15:20:24,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:26,772 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-10 15:20:26,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:26,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:20:26,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:20:26,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:20:26,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:20:26,774 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 78 states. [2018-10-10 15:20:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:30,619 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-10 15:20:30,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:20:30,620 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 263 [2018-10-10 15:20:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:30,621 INFO L225 Difference]: With dead ends: 269 [2018-10-10 15:20:30,621 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 15:20:30,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:20:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 15:20:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-10 15:20:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 15:20:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-10 15:20:30,624 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-10 15:20:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:30,625 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-10 15:20:30,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:20:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-10 15:20:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-10 15:20:30,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:30,626 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] [2018-10-10 15:20:30,626 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:30,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1862834457, now seen corresponding path program 75 times [2018-10-10 15:20:30,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:33,297 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-10 15:20:33,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:33,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:20:33,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:20:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:20:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:20:33,299 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 79 states. [2018-10-10 15:20:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:37,053 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-10 15:20:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:20:37,054 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 266 [2018-10-10 15:20:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:37,055 INFO L225 Difference]: With dead ends: 272 [2018-10-10 15:20:37,055 INFO L226 Difference]: Without dead ends: 272 [2018-10-10 15:20:37,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 15:20:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-10 15:20:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-10 15:20:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-10 15:20:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-10 15:20:37,058 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-10 15:20:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:37,059 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-10 15:20:37,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:20:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-10 15:20:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-10 15:20:37,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:37,060 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] [2018-10-10 15:20:37,060 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:37,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash -777845701, now seen corresponding path program 76 times [2018-10-10 15:20:37,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:39,996 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-10 15:20:39,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:39,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:20:39,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:20:39,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:20:39,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:20:39,997 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 80 states. [2018-10-10 15:20:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:44,094 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-10 15:20:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:20:44,094 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 269 [2018-10-10 15:20:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:44,095 INFO L225 Difference]: With dead ends: 275 [2018-10-10 15:20:44,095 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 15:20:44,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:20:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 15:20:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-10-10 15:20:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 15:20:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-10 15:20:44,099 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-10 15:20:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:44,099 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-10 15:20:44,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:20:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-10 15:20:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-10 15:20:44,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:44,100 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] [2018-10-10 15:20:44,100 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:44,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1635528153, now seen corresponding path program 77 times [2018-10-10 15:20:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:46,773 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-10 15:20:46,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:46,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:20:46,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:20:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:20:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:20:46,775 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 81 states. [2018-10-10 15:20:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:51,003 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-10 15:20:51,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:20:51,003 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 272 [2018-10-10 15:20:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:51,004 INFO L225 Difference]: With dead ends: 278 [2018-10-10 15:20:51,004 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 15:20:51,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:20:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 15:20:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-10 15:20:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:20:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-10 15:20:51,007 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-10 15:20:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:51,007 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-10 15:20:51,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:20:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-10 15:20:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 15:20:51,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:51,008 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] [2018-10-10 15:20:51,008 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:51,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 703477627, now seen corresponding path program 78 times [2018-10-10 15:20:51,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:53,992 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-10 15:20:53,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:53,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:20:53,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:20:53,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:20:53,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:20:53,993 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 82 states. [2018-10-10 15:20:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:58,521 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 15:20:58,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:20:58,522 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 275 [2018-10-10 15:20:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:58,523 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:20:58,523 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:20:58,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:20:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:20:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-10 15:20:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 15:20:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-10 15:20:58,526 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-10 15:20:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:58,526 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-10 15:20:58,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:20:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-10 15:20:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-10 15:20:58,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:58,527 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] [2018-10-10 15:20:58,528 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:58,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 949826201, now seen corresponding path program 79 times [2018-10-10 15:20:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:01,381 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-10 15:21:01,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:01,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:21:01,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:21:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:21:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:21:01,383 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 83 states. [2018-10-10 15:21:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:05,736 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-10 15:21:05,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:21:05,736 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 278 [2018-10-10 15:21:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:05,737 INFO L225 Difference]: With dead ends: 284 [2018-10-10 15:21:05,737 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 15:21:05,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:21:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 15:21:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-10-10 15:21:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 15:21:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-10 15:21:05,740 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 278 [2018-10-10 15:21:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:05,740 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-10 15:21:05,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:21:05,741 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-10 15:21:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-10 15:21:05,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:05,742 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] [2018-10-10 15:21:05,742 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:05,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash -178914629, now seen corresponding path program 80 times [2018-10-10 15:21:05,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:08,898 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-10 15:21:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:21:08,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:21:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:21:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:21:08,899 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 84 states. [2018-10-10 15:21:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:13,406 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-10 15:21:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:21:13,407 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 281 [2018-10-10 15:21:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:13,408 INFO L225 Difference]: With dead ends: 287 [2018-10-10 15:21:13,408 INFO L226 Difference]: Without dead ends: 287 [2018-10-10 15:21:13,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:21:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-10 15:21:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-10 15:21:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 15:21:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-10 15:21:13,413 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 281 [2018-10-10 15:21:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:13,413 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-10 15:21:13,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:21:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-10 15:21:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-10 15:21:13,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:13,414 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] [2018-10-10 15:21:13,414 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:13,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1198020775, now seen corresponding path program 81 times [2018-10-10 15:21:13,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:16,362 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-10 15:21:16,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:16,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:21:16,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:21:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:21:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:21:16,364 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 85 states. [2018-10-10 15:21:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:21,076 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-10 15:21:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:21:21,076 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 284 [2018-10-10 15:21:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:21,077 INFO L225 Difference]: With dead ends: 290 [2018-10-10 15:21:21,077 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 15:21:21,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:21:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 15:21:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-10 15:21:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 15:21:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-10-10 15:21:21,081 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 284 [2018-10-10 15:21:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:21,081 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-10-10 15:21:21,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:21:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-10-10 15:21:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 15:21:21,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:21,082 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] [2018-10-10 15:21:21,082 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:21,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:21,083 INFO L82 PathProgramCache]: Analyzing trace with hash -265400837, now seen corresponding path program 82 times [2018-10-10 15:21:21,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:24,421 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-10 15:21:24,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:24,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:21:24,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:21:24,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:21:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:21:24,423 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 86 states. [2018-10-10 15:21:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:29,264 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-10 15:21:29,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:21:29,265 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 287 [2018-10-10 15:21:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:29,266 INFO L225 Difference]: With dead ends: 293 [2018-10-10 15:21:29,266 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 15:21:29,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 15:21:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 15:21:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-10 15:21:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-10 15:21:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-10 15:21:29,270 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 287 [2018-10-10 15:21:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:29,270 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-10 15:21:29,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:21:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-10 15:21:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-10 15:21:29,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:29,271 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] [2018-10-10 15:21:29,271 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:29,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash -728265703, now seen corresponding path program 83 times [2018-10-10 15:21:29,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:33,176 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-10 15:21:33,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:33,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:21:33,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:21:33,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:21:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:21:33,177 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 87 states. [2018-10-10 15:21:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:38,069 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-10 15:21:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:21:38,070 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 290 [2018-10-10 15:21:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:38,071 INFO L225 Difference]: With dead ends: 296 [2018-10-10 15:21:38,071 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 15:21:38,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:21:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 15:21:38,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-10 15:21:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-10 15:21:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-10-10 15:21:38,074 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 290 [2018-10-10 15:21:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:38,074 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-10-10 15:21:38,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:21:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-10-10 15:21:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-10 15:21:38,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:38,076 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] [2018-10-10 15:21:38,076 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:38,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1204498747, now seen corresponding path program 84 times [2018-10-10 15:21:38,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:41,491 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-10 15:21:41,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:41,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:21:41,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:21:41,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:21:41,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:21:41,492 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 88 states. [2018-10-10 15:21:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:46,141 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-10 15:21:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:21:46,142 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 293 [2018-10-10 15:21:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:46,143 INFO L225 Difference]: With dead ends: 299 [2018-10-10 15:21:46,143 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 15:21:46,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:21:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 15:21:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-10 15:21:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 15:21:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-10 15:21:46,148 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 293 [2018-10-10 15:21:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:46,149 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-10 15:21:46,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:21:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-10 15:21:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-10 15:21:46,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:46,150 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] [2018-10-10 15:21:46,151 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:46,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1858658521, now seen corresponding path program 85 times [2018-10-10 15:21:46,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:49,710 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-10 15:21:49,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:49,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:21:49,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:21:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:21:49,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:21:49,712 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 89 states. [2018-10-10 15:21:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:54,791 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-10 15:21:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:21:54,792 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 296 [2018-10-10 15:21:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:54,793 INFO L225 Difference]: With dead ends: 302 [2018-10-10 15:21:54,793 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 15:21:54,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:21:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 15:21:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-10 15:21:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 15:21:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-10 15:21:54,797 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 296 [2018-10-10 15:21:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:54,797 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-10 15:21:54,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:21:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-10 15:21:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-10 15:21:54,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:54,798 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] [2018-10-10 15:21:54,799 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:54,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -629103493, now seen corresponding path program 86 times [2018-10-10 15:21:54,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:58,151 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-10 15:21:58,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:58,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:21:58,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:21:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:21:58,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:21:58,153 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 90 states. [2018-10-10 15:22:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:03,304 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-10 15:22:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:22:03,304 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 299 [2018-10-10 15:22:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:03,306 INFO L225 Difference]: With dead ends: 305 [2018-10-10 15:22:03,306 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 15:22:03,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:22:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 15:22:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-10 15:22:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 15:22:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-10 15:22:03,309 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 299 [2018-10-10 15:22:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:03,309 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-10 15:22:03,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:22:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-10 15:22:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-10 15:22:03,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:03,310 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] [2018-10-10 15:22:03,311 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:03,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash 408397209, now seen corresponding path program 87 times [2018-10-10 15:22:03,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:06,968 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-10 15:22:06,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:06,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:22:06,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:22:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:22:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:22:06,970 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 91 states. [2018-10-10 15:22:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:12,090 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-10 15:22:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:22:12,091 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 302 [2018-10-10 15:22:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:12,092 INFO L225 Difference]: With dead ends: 308 [2018-10-10 15:22:12,092 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 15:22:12,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:22:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 15:22:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2018-10-10 15:22:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 15:22:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-10 15:22:12,095 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 302 [2018-10-10 15:22:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:12,096 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-10 15:22:12,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:22:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-10 15:22:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-10 15:22:12,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:12,098 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] [2018-10-10 15:22:12,098 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:12,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2007148475, now seen corresponding path program 88 times [2018-10-10 15:22:12,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:15,898 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-10 15:22:15,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:15,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:22:15,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:22:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:22:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:22:15,900 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 92 states. [2018-10-10 15:22:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:21,140 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-10 15:22:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:22:21,141 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 305 [2018-10-10 15:22:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:21,142 INFO L225 Difference]: With dead ends: 311 [2018-10-10 15:22:21,142 INFO L226 Difference]: Without dead ends: 311 [2018-10-10 15:22:21,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:22:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-10 15:22:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-10 15:22:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-10 15:22:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-10 15:22:21,146 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 305 [2018-10-10 15:22:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:21,147 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-10 15:22:21,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:22:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-10 15:22:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-10 15:22:21,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:21,148 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] [2018-10-10 15:22:21,148 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:21,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash -781198759, now seen corresponding path program 89 times [2018-10-10 15:22:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:24,703 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-10 15:22:24,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:24,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:22:24,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:22:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:22:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:22:24,705 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 93 states. [2018-10-10 15:22:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:30,131 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-10 15:22:30,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:22:30,132 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 308 [2018-10-10 15:22:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:30,133 INFO L225 Difference]: With dead ends: 314 [2018-10-10 15:22:30,133 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 15:22:30,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:22:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 15:22:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-10 15:22:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-10 15:22:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-10-10 15:22:30,137 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 308 [2018-10-10 15:22:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:30,137 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-10-10 15:22:30,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:22:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-10-10 15:22:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-10 15:22:30,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:30,138 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] [2018-10-10 15:22:30,138 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:30,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash 528825083, now seen corresponding path program 90 times [2018-10-10 15:22:30,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:33,769 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-10 15:22:33,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:33,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:22:33,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:22:33,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:22:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:22:33,771 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 94 states. [2018-10-10 15:22:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:39,151 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-10 15:22:39,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:22:39,152 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 311 [2018-10-10 15:22:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:39,153 INFO L225 Difference]: With dead ends: 317 [2018-10-10 15:22:39,153 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 15:22:39,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:22:39,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 15:22:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-10 15:22:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 15:22:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-10 15:22:39,157 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 311 [2018-10-10 15:22:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:39,157 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-10 15:22:39,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:22:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-10 15:22:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-10 15:22:39,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:39,159 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] [2018-10-10 15:22:39,159 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:39,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash -918716647, now seen corresponding path program 91 times [2018-10-10 15:22:39,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:43,169 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-10 15:22:43,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:43,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:22:43,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:22:43,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:22:43,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:22:43,170 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 95 states. [2018-10-10 15:22:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:48,742 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-10 15:22:48,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:22:48,743 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 314 [2018-10-10 15:22:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:48,744 INFO L225 Difference]: With dead ends: 320 [2018-10-10 15:22:48,745 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 15:22:48,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:22:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 15:22:48,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-10-10 15:22:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 15:22:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-10 15:22:48,749 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 314 [2018-10-10 15:22:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:48,749 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-10 15:22:48,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:22:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-10 15:22:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-10 15:22:48,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:48,750 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] [2018-10-10 15:22:48,751 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:48,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1132224059, now seen corresponding path program 92 times [2018-10-10 15:22:48,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:53,011 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-10 15:22:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:22:53,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:22:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:22:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:22:53,013 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 96 states. [2018-10-10 15:22:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:58,815 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-10 15:22:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:22:58,815 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 317 [2018-10-10 15:22:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:58,816 INFO L225 Difference]: With dead ends: 323 [2018-10-10 15:22:58,816 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 15:22:58,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:22:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 15:22:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-10-10 15:22:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-10 15:22:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-10 15:22:58,819 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 317 [2018-10-10 15:22:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:58,820 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-10 15:22:58,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:22:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-10 15:22:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-10 15:22:58,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:58,821 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] [2018-10-10 15:22:58,821 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:58,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 502043609, now seen corresponding path program 93 times [2018-10-10 15:22:58,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:02,989 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-10 15:23:02,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:02,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:23:02,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:23:02,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:23:02,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:23:02,991 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 97 states. [2018-10-10 15:23:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:08,892 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-10 15:23:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:23:08,892 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 320 [2018-10-10 15:23:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:08,893 INFO L225 Difference]: With dead ends: 324 [2018-10-10 15:23:08,894 INFO L226 Difference]: Without dead ends: 324 [2018-10-10 15:23:08,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:23:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-10 15:23:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-10-10 15:23:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 15:23:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-10-10 15:23:08,898 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 320 [2018-10-10 15:23:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:08,898 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-10-10 15:23:08,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:23:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-10-10 15:23:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-10 15:23:08,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:08,900 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] [2018-10-10 15:23:08,900 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:08,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 98308475, now seen corresponding path program 94 times [2018-10-10 15:23:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:09,451 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-10 15:23:09,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:23:09,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 15:23:09,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:23:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:23:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:23:09,453 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 8 states. [2018-10-10 15:23:09,995 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 15:23:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:10,003 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-10 15:23:10,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:23:10,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 323 [2018-10-10 15:23:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:10,004 INFO L225 Difference]: With dead ends: 322 [2018-10-10 15:23:10,004 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:23:10,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:23:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:23:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:23:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:23:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:23:10,005 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2018-10-10 15:23:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:10,005 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:23:10,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:23:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:23:10,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:23:10,010 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:23:10 BoogieIcfgContainer [2018-10-10 15:23:10,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:23:10,011 INFO L168 Benchmark]: Toolchain (without parser) took 365281.59 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -25.2 MB). Free memory was 1.5 GB in the beginning and 871.8 MB in the end (delta: 582.3 MB). Peak memory consumption was 557.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:23:10,012 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-10 15:23:10,012 INFO L168 Benchmark]: Boogie Preprocessor took 54.30 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-10 15:23:10,012 INFO L168 Benchmark]: RCFGBuilder took 665.59 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:23:10,013 INFO L168 Benchmark]: TraceAbstraction took 364557.55 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -25.2 MB). Free memory was 1.4 GB in the beginning and 871.8 MB in the end (delta: 561.2 MB). Peak memory consumption was 536.0 MB. Max. memory is 7.1 GB. [2018-10-10 15:23:10,015 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.19 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 54.30 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 665.59 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 364557.55 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -25.2 MB). Free memory was 1.4 GB in the beginning and 871.8 MB in the end (delta: 561.2 MB). Peak memory consumption was 536.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: 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, 46 locations, 1 error locations. SAFE Result, 364.4s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 212.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3603 SDtfs, 19949 SDslu, 107472 SDs, 0 SdLazy, 29205 SolverSat, 4616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 315.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred 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.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 145.1s InterpolantComputationTime, 17290 NumberOfCodeBlocks, 17290 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 17195 ConstructedInterpolants, 0 QuantifiedInterpolants, 16869075 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_7.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-23-10-025.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-23-10-025.csv Received shutdown request...